## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# Sizes of Order Statistical Events of Stationary Processes

Daniel Rudolph and J. Michael Steele
The Annals of Probability
Vol. 8, No. 6 (Dec., 1980), pp. 1079-1084
Stable URL: http://www.jstor.org/stable/2243009
Page Count: 6
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available

## Abstract

Given a process $\{X_i\}$, any permutation $\sigma: \lbrack 1, n\rbrack \rightarrow \lbrack 1, n\rbrack$ determines an order statistical event $A(\sigma) = \{X_{\sigma(1)} < X_{\sigma(2)} < \cdots < X_{\sigma(n)}\}$. How many events $A(\sigma)$ are needed to form a union whose probability exceeds $1 - \epsilon$? This question is answered in the case of stationary ergodic processes with finite entropy.

• 1079
• 1080
• 1081
• 1082
• 1083
• 1084