Mean convergence for intermediately trimmed Birkhoff sums of observables with regularly varying tails
Marc Kesseb\"ohmer, Tanja Schindler

TL;DR
This paper proves mean convergence of trimmed Birkhoff sums for certain observables in dynamical systems with spectral gap, highlighting the importance of mixing conditions and extending results to i.i.d. cases.
Contribution
It establishes mean convergence for intermediately trimmed Birkhoff sums of observables with regularly varying tails under spectral gap and mild mixing conditions, a novel result even for i.i.d. variables.
Findings
Mean convergence holds under spectral gap and mixing conditions.
Counterexample shows convergence can fail without mixing.
Results extend to i.i.d. random variables.
Abstract
On a measure theoretical dynamical system with spectral gap property we consider non-integrable observables with regularly varying tails and fulfilling a mild mixing condition. We show that the normed trimmed sum process of these observables then converges in mean. This result is new also for the special case of i.i.d. random variables and contrasts the general case where mean convergence might fail even though a strong law of large numbers holds. To illuminate the required mixing condition we give an explicit example of a dynamical system fulfilling a spectral gap property and an observable with regularly varying tails but without the assumed mixing condition such that mean convergence fails.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Mean convergence for intermediately trimmed Birkhoff sums of observables with regularly varying tails
Marc Kesseböhmer
Universität Bremen, Fachbereich 3 – Mathematik und Informatik, Bibliothekstr. 1, 28359 Bremen, Germany
and
Tanja Schindler
Australian National University, Research School of Finance, Actuarial Studies and Statistics, 26C Kingsley St, Acton ACT 2601, Australia
(Date: March 12, 2024)
Abstract.
On a measure theoretical dynamical system with spectral gap property we consider non-integrable observables with regularly varying tails and fulfilling a mild mixing condition. We show that the normed trimmed sum process of these observables then converges in mean. This result is new also for the special case of i.i.d. random variables and contrasts the general case where mean convergence might fail even though a strong law of large numbers holds. To illuminate the required mixing condition we give an explicit example of a dynamical system fulfilling a spectral gap property and an observable with regularly varying tails but without the assumed mixing condition such that mean convergence fails.
Key words and phrases:
mean convergence, trimmed sum process, transfer operator, spectral method, -mixing, piecewise expanding interval maps
2010 Mathematics Subject Classification:
Primary: 60F25 Secondary: 37A05, 37A30, 37A25, 60G10
1. Introduction and statement of main results
We consider an ergodic measure preserving dynamical system with a probability measure and stochastic processes given by the Birkhoff sums , , with for some function sometimes called observable. If is finite, then we obtain by Birkhoff’s ergodic theorem – combining pointwise and mean convergence – that -almost surely (a.s.)
[TABLE]
i.e. the strong law of large numbers is fulfilled with norming sequence , whereas in the case , Aaronson ruled out the possibility of a strong law of large numbers no matter which norming sequence we choose, see [Aar77]. However, in certain cases after deleting a number of the largest summands from the partial -sums a strong law of large numbers holds. More precisely, for each we choose a permutation of with and for given we define
[TABLE]
If is fixed for all , then is called a lightly trimmed sum process. If we allow the sequence to diverge to infinity such that , i.e. , then is called an intermediately (also moderately) trimmed sum process.
The special case of regularly varying tail variables with index strictly between and [math] has been considered by the authors in [KS18]. That is for denoting the distribution function of we require that with and a slowly varying function, i.e. for every we have . Here, means that is asymptotic to at infinity, i.e. .
Under certain properties of the underlying process to be discussed later an intermediately trimmed strong law has been proven for such observables, i.e. there exist a non-negative integer sequence tending to infinity with and a norming sequence such that
[TABLE]
Additionally, an asymptotic formula for depending on has been provided in [KS18, Theorem 1.7]. The condition under which these trimming results hold are in particular a spectral gap property for the transfer operator und some regularity conditions on the observable , the precise conditions are stated as Property in Definition 1.3.
The above stated intermediately trimmed strong law can be seen as an analog to Birkhoff’s ergodic theorem. However in the finite case, Birkhoff’s ergodic theorem also implies that the norming sequence can be chosen as , see e.g. [KMS16, Prop. 2.4.21]. It is the purpose of the present paper to show that for regularly varying tail distributions with exponent strictly between and [math] we also have and in this way to give an analog statement of the ergodic theorem for the trimmed sum process. Since in Lemma 2.2 we also show convergence in probability, the above asymptotic is in fact equivalent to mean convergence (Theorem 1.5) and gives thus also an analog for von Neumann’s ergodic theorem. Crucial for our analysis will be an additional condition on in terms of the -mixing coefficients introduced in Definition 1.4. We will show that Property alone is indeed not strong enough for our main results to hold by providing an example with large -mixing coefficients and which can not obey any mean convergence, as , for all and any reasonable trimming sequence , see Theorem 1.10.
In the case of general distribution functions and the same mixing conditions it is too much to hope for such a mean convergence under trimming. The authors of this paper gave an example in [KS17, Remark 3] for i.i.d. random variables for which an intermediately trimmed strong law holds but , for all .
It is also worth mentioning that the almost sure trimming results mentioned above have predecessors in results for i.i.d. random variables where a vast literature for trimming results both for weak as well as for strong limit theorems exists. However, to the author’s knowledge the result given in this paper has not been proven for i.i.d. random variables either. We will here only give an overview of a number of strong convergence results. First of all one realizes that also for i.i.d. random variables a lightly trimmed strong law can not hold for random variables with regularly varying tail with exponent strictly between and [math]. By a lightly trimmed strong law we mean the existence of and a sequence of positive reals such that a.s. This can be deduced from the fact that there is no weak law of large numbers for random variables with such a distribution function, see [Fel71, VII.7 Theorem 2 and VIII.9 Theorem 1] and a result by Kesten which states that light trimming has no influence on weak convergence, see [Kes93]. However, an intermediately trimmed strong law in the i.i.d. case can be deduced from results by Haeusler and Mason, see [HM87] and [Hae93]. They proved generalized laws of the iterated logarithm under trimming from which an intermediately trimmed strong law follows and one can also infer a lower bound for . Indeed, this lower bound coincides with the lower bound for in the dynamical systems case given in [KS18]. The examples for which the setting of [KS18] holds are e.g. piecewise expanding interval maps and subshifts of finite type as shown in [KS18] and [KS19] respectively.
Some other trimming results have also been generalized to different dynamical system settings where -mixing also plays an important role. In fact, Aaronson and Nakada showed in [AN03] a lightly trimmed strong law for -mixing random variables which have particular distribution functions. This result generalizes the results of Mori for the i.i.d. case, see [Mor76, Mor77]. Aaronson and Nakada also gave an example of a non -mixing process with the same distribution function not fulfilling a lightly trimmed strong law. Furthermore, Haynes gave in [Hay14] a quantitative generalization for -mixing random variables of a result by Diamond and Vaaler who showed a lightly trimmed strong law for the continued fraction digits, see [DV86]. Haynes also compared this result with an observable on the doubling map for which the system is strongly mixing but not -mixing and for which a lightly trimmed strong laws fails to hold. This example also fulfills the spectral gap property and Property .
The results of this paper rely on two main properties: First, on an exponential inequality for dynamical systems which fulfill a spectral gap property with respect to the transfer operator, and second, on the -mixing property. The proof of the exponential inequality given in [KS18] is similar to the Nagaev-Guivarc’h spectral method for the central limit theorem. The spectral gap property for dynamical systems is a typical assumption under which limit theorems for dynamical systems can be proven, see the review papers [Gou15] and [FJ03] and references therein for further information and applications of the transfer operator method as well as examples of dynamical systems fulfilling a spectral gap property.
During the last decade there has also been some significant interest in other limit theorems for dynamical systems with heavy tailed distributions using transfer operator techniques, particularly convergence to a stable law, see the paper by Aaronson and Denker, [AD01], for sufficient and the paper by Gouëzel, [Gou10], for necessary conditions and previous results by Sarig, [Sar06]. Furthermore, see also the generalization by Melbourne and Zweimüller to intermittent maps, [MZ15], and by Tyran-Kaminska to a functional convergence, see [TK10]. The additional condition of -mixing is often necessary for proving limit theorems as illustrated above for the trimmed strong laws. Some results have also been proven under the combined assumptions of a spectral gap property and -mixing, as for example the law of an iterated logarithm for non-integrable random variables by Aaronson and Zweimüller, [AZ14].
In Example 1.9 we will give conditions on piecewise expanding interval maps and on the observable such that Property as well as the -mixing condition are fulfilled.
1.1. Basic setting
First we will make the notion of spectral gap precise and then restate the two crucial properties from [KS18]. The first, Property , considers dynamical systems with a spectral gap property. Afterwards we define our main property, Property , for which different convergence theorems have been proven in [KS18] and under which we will prove a mean convergence theorem under trimming.
Definition 1.1** (Spectral gap).**
Suppose is a Banach space and a bounded linear operator. We say that has a spectral gap if there exists a decomposition with and bounded linear operators such that
- •
is a one-dimensional projection, i.e. and its image is one-dimensional,
- •
is such that , where denotes the spectral radius,
- •
and are orthogonal, i.e. .
Definition 1.2** (Property , [KS18, Definition 1.1]).**
Let be a dynamical system with a non-singular transformation and be the transfer operator of , i.e. the uniquely defined operator such that for all and we have
[TABLE]
see e.g. [KMS16, Section 2.3] for further details. Furthermore, let be subset of the measurable functions forming a Banach algebra with respect to the norm . We say that has Property if the following conditions hold:
- •
is a -invariant, mixing probability measure.
- •
contains the constant functions and for all we have
[TABLE]
- •
is a bounded linear operator with respect to , i.e. there exists a constant such that for all we have
[TABLE]
- •
acting on the Banach space with norm has a spectral gap.
The above mentioned property is a widely used setting for dynamical systems. In particular it implies that the transfer operator has as a unique and simple eigenvalue on the unit circle and that an exponential decay of correlation is guaranteed.
However, in order to state our main theorems we need additional assumptions on the observable defined on a system fulfilling Property .
Definition 1.3** (Property , [KS18, Definition 1.2]).**
We say that has Property if the following conditions hold:
- •
fulfills Property .
- •
and with there exists such that for all ,
[TABLE]
Finally, to state our main theorem we give the precise definition of -mixing following [Bra05]. Note that in the literature there are sometimes subtle differences defining this notion.
Definition 1.4**.**
Let be a probability measure space and two -fields, then the following measure of dependence is defined
[TABLE]
Furthermore, let be a (not necessarily stationary) sequence of random variables. For we can define a -field by
[TABLE]
With this at hand the -mixing coefficients are defined by
[TABLE]
The sequence of random variables is said to be -mixing if .
1.2. Main results
For being slowly varying we denote by a de Bruijn conjugate of , i.e. a slowly varying function satisfying
[TABLE]
For more details see [BGT87, Section 1.5.7 and Appendix 5]. Then our first main result reads as follows.
Theorem 1.5**.**
Let fulfill Property and assume that , where is a slowly varying function and . Further, let be a sequence of natural numbers tending to infinity such that . We assume that at least one -mixing coefficient of the sequence of random variables is strictly less than one. Then mean convergence holds with norming sequence
[TABLE]
that is
[TABLE]
Remark 1.6*.*
It has been shown in [KS18] that under Property and with growing sufficiently fast we have a.s. where shows the same asymptotic as (5). Combining this statement with Theorem 1.5 yields that for sufficiently fast growing we have
[TABLE]
Remark 1.7*.*
Note that -mixing is sufficient but not necessary for Theorem 1.5.
For our main example, we first define the space of functions of bounded variation. For simplicity, we restrict ourself to the interval and let denote the Borel sets of .
Definition 1.8**.**
Let . Then the variation of is given by
[TABLE]
and we define
[TABLE]
By we denote the Banach space of functions of bounded variation, i.e. of functions fulfilling . It is equipped with the norm .
With this we can state our main example.
Example 1.9*.*
Let be a dense and open set such that and let be a countable family of closed intervals with disjoint interiors and for any such that the set consists exactly of the endpoints of . Furthermore, we assume that fulfills the following properties:
- •
(Adler’s condition) and is bounded on .
- •
(Finite image condition) .
- •
(Uniform expansion) There exists such that for all .
- •
is topologically mixing.
Furthermore, we assume that is constant on the interior of each interval and there exists a constant such that for all
[TABLE]
Then there exists a probability measure absolutely continuous to the Lebesgue measure such that fulfills Property and is a -mixing.
We note here that this example mainly relies on results in [Ryc83] on piecewise expanding interval maps on countable partitions generalizing [LY73] where finite partitions are considered. It follows from [Zwe98] that fulfills Property . Furthermore, (6) implies (4) and thus fulfills Property . This was discussed in detail in [KS18, Section 1.4]. Finally, that is -mixing follows by [AN05, Theorem 1]. As an explicit example one could choose the partition , , with any fulfilling the above properties with respect to this partition and and the underlying invariant measure calculated as in [Ryc83].
Our next theorem shows that indeed Property alone is not sufficient for our main theorem.
Theorem 1.10**.**
Let and with the Lebesgue measure restricted to . Further define by with . Then there exists a Banach space with a norm such that fulfills Property . If on the other hand tends to infinity with , then
[TABLE]
for all .
Remark 1.11*.*
To the authors’ knowledge this theorem is also a new result for the setting of i.i.d. random variables. Indeed the case of i.i.d. random variables follows as a special case from this setting. A proof of this fact will be given in Section 2.3.
2. Proofs of main theorems
The second part of our paper is devoted to the proofs of the theorems; the proof of Theorem 1.5 will be given in Section 2.1, the proof of Theorem 1.10 in Section 2.2, and the proof of Remark 1.11 in Section 2.3.
2.1. Proof of Theorem 1.5
Theorem 1.5 is proven by proving the following two lemmas:
Lemma 2.1**.**
Let fulfill Property and assume that , where is a slowly varying function and . Further, let be a sequence of natural numbers tending to infinity such that . We assume that at least one -mixing coefficient of the sequence of random variables is strictly less than one. Then with as in (5).
Lemma 2.2**.**
Let fulfill Property and assume that , where is a slowly varying function and . Further, let be a sequence of natural numbers tending to infinity such that . Then with given in (5), we have the following convergence in probability:
[TABLE]
Using Pratt’s theorem [Pra60] in combination with Lemma 2.1 and 2.2 immediately gives the statement of Theorem 1.5.
In preparation of the proof of these lemmas, for and a real valued sequence we recall the definition of the truncated function
[TABLE]
given in Definition 1.3 and define the associated truncated sum
[TABLE]
If tends to infinity, we have that
[TABLE]
see [KS18, Lemma 3.18] for a detailed calculation.
Proof of Lemma 2.1.
We recall that is the distribution function of with respect to , i.e. . Let be defined as and set
[TABLE]
We will split the proof of the lemma into the following parts:
- (A)
We have that
[TABLE] 2. (B)
For all there exists such that for all
[TABLE] 3. (C)
For all there exists such that for all
[TABLE]
Proof of (A): The proof of a statement similar to (A) can be found at the end of the proof of Theorem 1.7 in [KS18]. Indeed, there it is shown that is asymptotic to the right hand side of (9). The sequence does not necessarily coincide with . However, the sequences can be written as and with . The proof in [KS18] essentially proves that \int\mathsf{T}_{n}^{f_{n}}\chi\;\mathrm{d}\mu\sim\alpha/(1-\alpha)\cdot n^{1/\alpha}\cdot v_{n}^{1-1/\alpha}\cdot\left(L^{-1/\alpha}\right)^{\#}\big{(}\left(n/v_{n}\right)^{1/\alpha}\big{)} allowing us to conclude from the asymptotic in (9). The sequence can be treated analogously.
Proof of (B): In order to prove (B) we set for ,
[TABLE]
Clearly,
[TABLE]
We will show in the following that is negligible compared to . First we define and
[TABLE]
Since , we have that . We will show (B) by proving the following three statements:
- (B1)
We have for all and sufficiently large uniformly in that
[TABLE] 2. (B2)
We have
[TABLE] 3. (B3)
We have
[TABLE]
Combining these statements with (11) proves (B). In (B1) we have used a short notation which we will also use in the sequel. If we write that a statement depending on and holds for sufficiently large uniformly in we mean that there exists such that the statement holds for all and all .
Proof of (B1): We will start this section with a set of definitions explaining in the sequel the strategy of the proof. Let
[TABLE]
Further, for let . Loosely speaking our set determines for each if or holds, or if no information about is gained.
Remember that . Further, let and let
[TABLE]
Here and in the following we denote by the complement of a set . Since , the definition of implies for each and that
[TABLE]
Thus, we have for each and
[TABLE]
For each , , and we can write as an intersection of two events , where
[TABLE]
If , then we set and if , then we set . Loosely speaking, is determined by the information of the first entries and of the last entries starting from the -th. We notice that for
[TABLE]
To estimate this term we will use the th -mixing coefficient for which by assumption we have that . To make use of the -mixing property we notice that for any random variables
[TABLE]
where we denote by the covariance, see e.g. [Dou94, Theorem 3, Chapter 1.2.2]. This implies for non-negative random variables
[TABLE]
The following statements will all hold for all , and . For brevity we will not mention that for each of the following calculations. By noticing that
[TABLE]
we obtain
[TABLE]
Using (14) in the other direction gives for non-negative random variables
[TABLE]
yielding
[TABLE]
and thus
[TABLE]
Combining this with (12) and (13) implies (B1).
Proof of (B2): We will first estimate using (7) and applying Potter’s bound, see e.g. [BGT87, Theorem 1.5.6], which gives
[TABLE]
for sufficiently large uniformly in .
Next, we will estimate . We will use two different techniques, one for rather small and the other for larger . We start with the estimate for the smaller . To ease notation we set , for any measurable set . We notice that for all ,
[TABLE]
Furthermore, applying the definition of the distribution function and Potter’s bound implies
[TABLE]
for sufficiently large uniformly in . Next, we aim to prove that . On the one hand we have that and on the other hand . Hence, the definition of in (8) gives
[TABLE]
and thus
[TABLE]
for sufficiently large uniformly in and thus
[TABLE]
for sufficiently large uniformly in .
In order to proceed we will make use of the following lemma.
Lemma 2.3** ([KS18, Lemma 2.9]).**
Let fulfill Property . Then there exist positive constants , , such that for all fulfilling , all , and all we have
[TABLE]
Combining (18), (22), and Lemma 2.3 yields
[TABLE]
for sufficiently large uniformly in . Furthermore, we have that
[TABLE]
and (21) implies
[TABLE]
for sufficiently large uniformly in . With defined in (4) we get
[TABLE]
and thus an application of (23), (24), and (25) gives
[TABLE]
for sufficiently large uniformly in , where
[TABLE]
By using this estimate and (17) we can further estimate
[TABLE]
This will later give us the estimate for small , let us proceed with an estimate for large values of . Let . There exists such that for all and we have
[TABLE]
We have that
[TABLE]
and thus
[TABLE]
Each of the summands can be estimated using (15):
[TABLE]
We have that
[TABLE]
implying
[TABLE]
With (21) we conclude
[TABLE]
for sufficiently large uniformly in . Combining this estimate with (17) and (28) gives
[TABLE]
for sufficiently large uniformly in .
Finally, we combine the estimates for small and large given in (27) and (29) to obtain
[TABLE]
Estimating the sums of the first factor of (30) separately implies
[TABLE]
for sufficiently large and
[TABLE]
for sufficiently large. Since we chose , (32) tends to zero for tending to infinity. Combining (31) and (32) with (30) proves the statement of (B2).
Proof of (B3): In order to consider the case we notice that by the definition of in (8) and the fact that we have that
[TABLE]
and thus . If we combine this with (18), we can conclude
[TABLE]
for sufficiently large. Using Lemma 2.3 implies
[TABLE]
for sufficiently large. Using (20), we have that
[TABLE]
for sufficiently large. Therefore,
[TABLE]
for sufficiently large. Combining (25) with (34) and (35) and using the definition of yields for sufficiently large that
[TABLE]
for sufficiently large which tends to zero for tending to infinity. If we combine this with (17), we obtain (B3).
Proof of (C): We set and have that
[TABLE]
It is sufficient to show
[TABLE]
and
[TABLE]
We start with showing (38). We have by (7) and the definition of that
[TABLE]
This together with (20) shows (38).
Let us look at the asymptotic (37). Similarly as in the proof of (B1) set
[TABLE]
This implies
[TABLE]
Using an analogous argument as in (B1) we obtain with the help of (16) that
[TABLE]
In the next steps we estimate . We have that
[TABLE]
for sufficiently large. Hence, (33) implies that we can estimate in the same manner as and obtain by (36) that we have for sufficiently large that which tends to zero for tending to infinity. Combining this observation with (39) proves (37) which was the final step in the proof of (C). ∎
Proof of Lemma 2.2.
We make use of the following upper estimate:
[TABLE]
and we will show that both terms on the right-hand side tend to zero for tending to infinity. In order to estimate the first summand of (40) we note that
[TABLE]
With given in (10) we also have . An application of (12) and (26) implies that tends to zero for tending to infinity.
In order to estimate we note that (9) implies . If we set , then
[TABLE]
for sufficiently large, and an application of Lemma 2.3 hence gives
[TABLE]
for sufficiently large where . We note that the first part of (4) implies
[TABLE]
and , for sufficiently large, where the last inequality follows from (9). Combining this with (41) and (42) yields
[TABLE]
for sufficiently large and sufficiently small. We obtain with an analogous calculation as in [KS18, Proof of Theorem 1.7] that
[TABLE]
Hence, by the definition of in (5) we have that and
[TABLE]
for sufficiently large. Consequently, the right-hand side tends to zero as tends to infinity.
Next we will estimate the second summand of (40). For arbitrary we have that
[TABLE]
We first estimate
[TABLE]
By a calculation analogous to (19) and (20) we obtain that , for sufficiently large from which we can conclude
[TABLE]
for sufficiently large. Applying Lemma 2.3 yields
[TABLE]
for sufficiently large.
Similarly as in (24) we obtain , for sufficiently large and similarly as in (25) we obtain . Setting
[TABLE]
implies
[TABLE]
for sufficiently large which tends to zero for tending to infinity.
Finally, we estimate . From (7) and (9) we can conclude that
[TABLE]
Hence,
[TABLE]
for sufficiently large. We can choose sufficiently small such that and an application of Lemma 2.3 yields
[TABLE]
Similarly as above we have that and and with an analogous estimation as the one leading to (43) we obtain
[TABLE]
for sufficiently large and sufficiently small, which tends to zero for tending to infinity. ∎
2.2. Proof of Theorem 1.10
Proof of Theorem 1.10.
Since the Lebesgue measure is -invariant, we notice that the system is precisely the system of piecewise expanding interval maps covered in [KS18, Section 1.4] with defined as in Definition 1.8. The last condition to check is that there exists a constant such that for all we have that and which is obviously fulfilled for our choice of .
Let with , then
[TABLE]
yielding . Furthermore, is decreasing in . Hence, and thus
[TABLE]
Since can be chosen arbitrarily small, this implies . ∎
2.3. Proof of the statement in Remark 1.11
Last, we show how our results carry over to the i.i.d. case.
Proof of the statement in Remark 1.11.
Let be a sequence of i.i.d. random variables mapping with probability measure . Then we define by . Further, let . Since the random variables are independent and identical distributed, can be written as . The measure is invariant and mixing with respect to the dynamics obtained by the shift map given by . If we write and set , we obtain .
Furthermore, we might introduce the Banach space of functions on the shift space as all functions with as a norm such that is already determined by . Obviously, is a Banach space which contains the constant functions and fulfills (2) and (3).
Furthermore, the transfer operator of the transformation has a spectral gap on . This can be easily seen by considering that for all and we have (1). In case that we even have that , which follows from the fact that and are independent with respect to . If , the above equality is fulfilled for all and since the transfer operator is uniquely defined, the equality has to hold. Since is a projection, we can write and do not even need an additional operator , i.e. we have an even stronger statement than a spectral gap. It is also immediately clear that in the i.i.d. case we have , for all .
If we set as the observable, then (4) are fulfilled and we can apply all theorems to this system. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Aar 77] J. Aaronson. On the ergodic theory of non-integrable functions and infinite measure spaces. Israel J. Math. , 27(2):163–173, 1977.
- 2[AD 01] J. Aaronson and M. Denker. Local limit theorems for partial sums of stationary sequences generated by Gibbs-Markov maps. Stoch. Dyn. , 1(2):193–237, 2001.
- 3[AN 03] J. Aaronson and H. Nakada. Trimmed sums for non-negative, mixing stationary processes. Stochastic Process. Appl. , 104(2):173–192, 2003.
- 4[AN 05] J. Aaronson and H. Nakada. On the mixing coefficients of piecewise monotonic maps. Israel J. Math. , 148:1–10, 2005.
- 5[AZ 14] J. Aaronson and R. Zweimüller. Limit theory for some positive stationary processes with infinite mean. Ann. Inst. Henri Poincaré Probab. Stat. , 50(1):256–284, 2014.
- 6[BGT 87] N. H. Bingham, C. M. Goldie, and J. L. Teugels. Regular Variation . Cambridge University Press, Cambridge, 1987.
- 7[Bra 05] R. C. Bradley. Basic properties of strong mixing conditions. A survey and some open questions. Probab. Surv. , 2:107–144, 2005.
- 8[Dou 94] P. Doukhan. Mixing: Properties and Examples . Springer, New York, 1994.
