The central limit problem for trimmed sums

Philip S. Griffin, William E. Pruitt

Mathematical Proceedings of the Cambridge Philosophical Society · 1987 · 35 citations · 10 references

Concepts

Abstract

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

References

10