SearcharxivSearch

arXiv · 2411.03528

On a boundary of the central limit theorem for strictly stationary, reversible Markov chains

Abstract

Consider the class of (functions of) strictly stationary Markov chains in which (i) the second moments are finite and (ii) absolute regularity (beta-mixing) is satisfied with exponential mixing rate. For (functions of) Markov chains in that class that are also reversible, the central limit theorem holds, as a well known byproduct of results of Roberts, Rosenthal, and Tweedie in two papers in 1997 and 2001 involving reversible Markov chains. In contrast, for (functions of) Markov chains in that class that are not reversible, the central limit theorem may fail to hold, as is known from counterexamples, including ones with arbitrarily fast mixing rate (for absolute regularity). Here it will be shown that for Markov chains in that class that are reversible, the``borderline'' class of mixing rates (for absolute regularity) for the central limit theorem is in fact exponential. That will be shown here with a class of counterexamples: strictly stationary, countable-state Markov chains that are reversible, have finite second moments, and satisfy absolute regularity with mixing rates that can be arbitrarily close to (but not quite) exponential, but fail to satisfy the central limit theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Richard C. Bradley. 2024-11-05. On a boundary of the central limit theorem for strictly stationary, reversible Markov chains. https://arxiv.org/abs/2411.03528

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR