Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T19:47:27.432Z Has data issue: false hasContentIssue false

The central limit problem for trimmed sums

Published online by Cambridge University Press:  24 October 2008

Philip S. Griffin
Affiliation:
Department of Mathematics, Syracuse University, Syracuse, NY 13210, U.S.A.
William E. Pruitt
Affiliation:
School of Mathematics, University of Minnesota, Minneapolis, MN 55455, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1987