IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v32y2019i2d10.1007_s10959-017-0802-0.html
   My bibliography  Save this article

Strong Laws of Large Numbers for Intermediately Trimmed Sums of i.i.d. Random Variables with Infinite Mean

Author

Listed:
  • Marc Kesseböhmer

    (Universität Bremen)

  • Tanja Schindler

    (Australian National University)

Abstract

We show that for every sequence of nonnegative i.i.d. random variables with infinite mean there exists a proper moderate trimming such that for the trimmed sum process a non-trivial strong law of large numbers holds. We provide an explicit procedure to find a moderate trimming sequence even if the underlying distribution function has a complicated structure, e.g., has no regularly varying tail distribution.

Suggested Citation

  • Marc Kesseböhmer & Tanja Schindler, 2019. "Strong Laws of Large Numbers for Intermediately Trimmed Sums of i.i.d. Random Variables with Infinite Mean," Journal of Theoretical Probability, Springer, vol. 32(2), pages 702-720, June.
    • Handle: RePEc:spr:jotpro:v:32:y:2019:i:2:d:10.1007_s10959-017-0802-0
    DOI: 10.1007/s10959-017-0802-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-017-0802-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-017-0802-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Csörgo, Sándor & Simons, Gordon, 1996. "A strong law of large numbers for trimmed sums, with applications to generalized St. Petersburg games," Statistics & Probability Letters, Elsevier, vol. 26(1), pages 65-73, January.
    2. Aaronson, Jon & Nakada, Hitoshi, 2003. "Trimmed sums for non-negative, mixing stationary processes," Stochastic Processes and their Applications, Elsevier, vol. 104(2), pages 173-192, April.
    3. Einmahl, J.H.J. & Haeusler, E. & Mason, D.M., 1988. "On the relationship between the almost sure stability of weighted empirical distributions and sums of order statistics," Other publications TiSEM df0f63ff-d20e-4578-86ae-8, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kesseböhmer, Marc & Schindler, Tanja, 2019. "Strong laws of large numbers for intermediately trimmed Birkhoff sums of observables with infinite mean," Stochastic Processes and their Applications, Elsevier, vol. 129(10), pages 4163-4207.
    2. Allan Gut & Anders Martin-Löf, 2016. "A Maxtrimmed St. Petersburg Game," Journal of Theoretical Probability, Springer, vol. 29(1), pages 277-291, March.
    3. István Berkes & László Györfi & Péter Kevei, 2017. "Tail Probabilities of St. Petersburg Sums, Trimmed Sums, and Their Limit," Journal of Theoretical Probability, Springer, vol. 30(3), pages 1104-1129, September.
    4. Takahasi, Hiroki, 2022. "Large deviation principle for the backward continued fraction expansion," Stochastic Processes and their Applications, Elsevier, vol. 144(C), pages 153-172.
    5. David M. Mason, 2006. "Cluster Sets of Self-Normalized Sums," Journal of Theoretical Probability, Springer, vol. 19(4), pages 911-930, December.
    6. Csörgo, Sándor & Simons, Gordon, 2007. "St. Petersburg games with the largest gains withheld," Statistics & Probability Letters, Elsevier, vol. 77(12), pages 1185-1189, July.
    7. Alina Bazarova & István Berkes & Lajos Horváth, 2016. "On the Extremal Theory of Continued Fractions," Journal of Theoretical Probability, Springer, vol. 29(1), pages 248-266, March.
    8. Gut, Allan & Martin-Löf, Anders, 2015. "Extreme-trimmed St. Petersburg games," Statistics & Probability Letters, Elsevier, vol. 96(C), pages 341-345.
    9. Vu T. N. Anh & Nguyen T. T. Hien & Le V. Thanh & Vo T. H. Van, 2021. "The Marcinkiewicz–Zygmund-Type Strong Law of Large Numbers with General Normalizing Sequences," Journal of Theoretical Probability, Springer, vol. 34(1), pages 331-348, March.
    10. Csörgo, Sándor & Simons, Gordon, 1996. "A strong law of large numbers for trimmed sums, with applications to generalized St. Petersburg games," Statistics & Probability Letters, Elsevier, vol. 26(1), pages 65-73, January.
    11. Kevei, Péter, 2007. "Generalized n-Paul paradox," Statistics & Probability Letters, Elsevier, vol. 77(11), pages 1043-1049, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:32:y:2019:i:2:d:10.1007_s10959-017-0802-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.