IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v17y2004i3d10.1023_bjotp.0000040292.52298.fd.html
   My bibliography  Save this article

Prokhorov Blocks and Strong Law of Large Numbers Under Rearrangements

Author

Listed:
  • S. Chobanyan

    (Georgian Academy of Sciences)

  • S. Levental

    (Michigan State University)

  • V. Mandrekar

    (Michigan State University)

Abstract

We find conditions on a sequence of random variables to satisfy the strong law of large numbers (SLLN) under a rearrangement. It turns out that these conditions are necessary and sufficient for the permutational SLLN (PSLLN). By PSLLN we mean that the SLLN holds under almost all simple permutations within blocks the lengths of which grow exponentially (Prokhorov blocks). In the case of orthogonal random variables it is shown that Kolmogorov's condition, that is known not to be sufficient for SLLN, is actually sufficient for PSLLN. It is also shown that PSLLN holds for sequences that are strictly stationary with finite first moments. In the case of weakly stationary sequences a Gaposhkin result implies that SLLN and PSLLN are equivalent. Finally we consider the case of general norming and generalization of the Nikishin theorem. The methods of proof uses on the one hand the idea of Prokhorov blocks and Garsia's construction of product measure on the space of simple permutations, and on the other hand, a maximal inequality for permutations.

Suggested Citation

  • S. Chobanyan & S. Levental & V. Mandrekar, 2004. "Prokhorov Blocks and Strong Law of Large Numbers Under Rearrangements," Journal of Theoretical Probability, Springer, vol. 17(3), pages 647-672, July.
    • Handle: RePEc:spr:jotpro:v:17:y:2004:i:3:d:10.1023_b:jotp.0000040292.52298.fd
    DOI: 10.1023/B:JOTP.0000040292.52298.fd
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOTP.0000040292.52298.fd
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:JOTP.0000040292.52298.fd?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.

    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:17:y:2004:i:3:d:10.1023_b:jotp.0000040292.52298.fd. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.