Refining the exponential asymptotic expansion for the distribution function of a sum of a random number of nonnegative random variables

1997 ◽  
Vol 33 (1) ◽  
pp. 89-96 ◽  
Author(s):  
A. N. Nakonechnyi
2009 ◽  
Vol 46 (1) ◽  
pp. 61-96
Author(s):  
Anna Pósfai ◽  
Sándor Csörgő

A collector samples with replacement a set of n ≧ 2 distinct coupons until he has n − m , 0 ≦ m < n , distinct coupons for the first time. We refine the limit theorems concerning the standardized random number of necessary draws if n → ∞ and m is fixed: we give a one-term asymptotic expansion of the distribution function in question, providing a better approximation of it, than the one given by the limiting distribution function, and proving in particular that the rate of convergence in these limiting theorems is of order (log n )/ n .


1973 ◽  
Vol 10 (4) ◽  
pp. 869-874 ◽  
Author(s):  
L. M. Marsh

The Edgeworth expansion gives an indication of the rate of convergence of the distribution function of the sum of a fixed number of random variables to the normal distribution. A similar expansion is given here for the distribution function of the sum of a random number N of random variables, when the probability generating function of N takes a special form.


1973 ◽  
Vol 10 (04) ◽  
pp. 869-874 ◽  
Author(s):  
L. M. Marsh

The Edgeworth expansion gives an indication of the rate of convergence of the distribution function of the sum of a fixed number of random variables to the normal distribution. A similar expansion is given here for the distribution function of the sum of a random number N of random variables, when the probability generating function of N takes a special form.


2020 ◽  
Vol 26 (2) ◽  
pp. 163-169
Author(s):  
Vladimir Nekrutkin

AbstractThis paper is devoted to random-bit simulation of probability densities, supported on {[0,1]}. The term “random-bit” means that the source of randomness for simulation is a sequence of symmetrical Bernoulli trials. In contrast to the pioneer paper [D. E. Knuth and A. C. Yao, The complexity of nonuniform random number generation, Algorithms and Complexity, Academic Press, New York 1976, 357–428], the proposed method demands the knowledge of the probability density under simulation, and not the values of the corresponding distribution function. The method is based on the so-called binary decomposition of the density and comes down to simulation of a special discrete distribution to get several principal bits of output, while further bits of output are produced by “flipping a coin”. The complexity of the method is studied and several examples are presented.


Author(s):  
RONALD R. YAGER

We look at the issue of obtaining a variance like measure associated with probability distributions over ordinal sets. We call these dissonance measures. We specify some general properties desired in these dissonance measures. The centrality of the cumulative distribution function in formulating the concept of dissonance is pointed out. We introduce some specific examples of measures of dissonance.


1987 ◽  
Vol 102 (2) ◽  
pp. 329-349 ◽  
Author(s):  
Philip S. Griffin ◽  
William E. Pruitt

Let X, X1, X2,… be a sequence of non-degenerate i.i.d. random variables with common distribution function F. For 1 ≤ j ≤ n, let mn(j) be the number of Xi satisfying either |Xi| > |Xj|, 1 ≤ i ≤ n, or |Xi| = |Xj|, 1 ≤ i ≤ j, and let (r)Xn = Xj if mn(j) = r. Thus (r)Xn is the rth largest random variable in absolute value from amongst X1, …, Xn with ties being broken according to the order in which the random variables occur. Set (r)Sn = (r+1)Xn + … + (n)Xn and write Sn for (0)Sn. We will refer to (r)Sn as a trimmed sum.


2017 ◽  
Vol 20 (5) ◽  
pp. 939-951
Author(s):  
Amal Almarwani ◽  
Bashair Aljohani ◽  
Rasha Almutairi ◽  
Nada Albalawi ◽  
Alya O. Al Mutairi

1991 ◽  
Vol 7 (4) ◽  
pp. 450-463 ◽  
Author(s):  
P.C.B. Phillips

Using generalized functions of random variables and generalized Taylor series expansions, we provide quick demonstrations of the asymptotic theory for the LAD estimator in a regression model setting. The approach is justified by the smoothing that is delivered in the limit by the asymptotics, whereby the generalized functions are forced to appear as linear functionals wherein they become real valued. Models with fixed and random regressors, and autoregressions with infinite variance errors are studied. Some new analytic results are obtained including an asymptotic expansion of the distribution of the LAD estimator.


Sign in / Sign up

Export Citation Format

Share Document