A note on logarithmic tail asymptotics and mixing
Let Y1,Y2,... be a stationary, ergodic sequence of non-negative random variables with heavy tails. Under mixing conditions, we derive logarithmic tail asymptotics for the distributions of the arithmetic mean. If not all moments of Y1 are finite, these logarithmic asymptotics amount to a weaker form of the Baum-Katz law. Roughly, the sum of i.i.d. heavy-tailed non-negative random variables has the same behaviour as the largest term in the sum, and this phenomenon persists for weakly dependent random variables. Under mixing conditions, the rate of convergence in the law of large numbers is, as in the i.i.d. case, determined by the tail of the distribution of Y1. There are many results which make these statements more precise. The paper describes a particularly simple way to carry over logarithmic tail asymptotics from the i.i.d. to the mixing case.
Year of publication: |
2000
|
---|---|
Authors: | Gantert, Nina |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 49.2000, 2, p. 113-118
|
Publisher: |
Elsevier |
Keywords: | Baum-Katz law Rate of convergence in the strong law Mixing Absolutely regular sequence Regularly varying tail Semiexponential distributions [beta]-mixing |
Saved in:
Saved in favorites
Similar items by person
-
Random walks on Galton–Watson trees with random conductances
Gantert, Nina, (2012)
-
Deviations of a random walk in a random scenery with stretched exponential tails
Gantert, Nina, (2006)
-
Many visits to a single site by a transient random walk in random environment
Gantert, Nina, (2002)
- More ...