| Popis: |
We consider the problem of approximating a continuous random variable, characterized by a cumulative distribution function (cdf) F(x), by means of k points, $$x_1 x 1 < x 2 < ⋯ < x k , with probabilities $$p_i$$ p i , $$i=1,\dots ,k$$ i = 1 , ⋯ , k . For a given k, a criterion for determining the $$x_i$$ x i and $$p_i$$ p i of the approximating k-point discrete distribution can be the minimization of some distance to the original distribution. Here we consider the weighted Cramér-von Mises distance between the original cdf F(x) and the step-wise cdf $${\hat{F}}(x)$$ F ^ ( x ) of the approximating discrete distribution, characterized by a non-negative weighting function w(x). This problem has been already solved analytically when w(x) corresponds to the probability density function of the continuous random variable, $$w(x)=F'(x)$$ w ( x ) = F ′ ( x ) , and when w(x) is a piece-wise constant function, through a numerical iterative procedure based on a homotopy continuation approach. In this paper, we propose and implement a solution to the problem for different choices of the weighting function w(x), highlighting how the results are affected by w(x) itself and by the number of approximating points k, in addition to F(x); although an analytic solution is not usually available, yet the problem can be numerically solved through an iterative method, which alternately updates the two sub-sets of k unknowns, the $$x_i$$ x i ’s (or a transformation thereof) and the $$p_i$$ p i ’s, till convergence. The main apparent advantage of these discrete approximations is their universality, since they can be applied to most continuous distributions, whether they possess or not the first moments. In order to shed some light on the proposed approaches, applications to several well-known continuous distributions (among them, the normal and the exponential) and to a practical problem where discretization is a useful tool are also illustrated. |
