Access

You are not currently logged in.

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

login

Log in to your personal account or through your 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.

On the Supremum of Sn/n

B. J. McCabe and L. A. Shepp
The Annals of Mathematical Statistics
Vol. 41, No. 6 (Dec., 1970), pp. 2166-2168
Stable URL: http://www.jstor.org/stable/2240360
Page Count: 3
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
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.
On the Supremum of Sn/n
Preview not available

Abstract

Let X1, X2, ⋯ be independent and identically distributed. We give a simple proof based on stopping times of the known result that $\sup(|X_1 + \cdots + X_n|/n)$ has a finite expected value if and only if E|X| log |X| is finite. Whenever E|X| log |X| = ∞, a simple nonanticipating stopping rule τ, not depending on X, yields E(|X1 + ⋯ + Xτ|/τ) = ∞.

Page Thumbnails

  • Thumbnail: Page 
2166
    2166
  • Thumbnail: Page 
2167
    2167
  • Thumbnail: Page 
2168
    2168