On the functional CLT for slowly mixing triangular arrays
Abstract
In MPU a functional CLT was obtained for triangular arrays satisfying the Lindeberg condition, that the sum of the individual variances is at most the same order as the variance of the underlying sum, and under the optimal mixing rats Σn(2n)<∞, where (·) are the -mixing coefficients of the array. In this paper we will present alternative conditions which do not involve the assumption on the sum of variances, and instead we will assume certain maximal moment assumptions (which we can verify for φ-mixing arrays) and mixing rates of the form Σn(eG(n))<∞ where G(n) grows sub-linearly fast in n (e.g. G(n)=n/( n)). We will also discuss alternative conditions to the ones in the functional CLT for α-mixing triangular arrays which was obtained in MP.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.