SearcharxivSearch

arXiv · 2510.15323

Limit theorems for inhomogeneous $\phi$-mixing Markov chains

Abstract

We prove limit theorems for inhomogeneous $\phi$-mixing Markov chains. In the case of uniform $\phi$-mixing, we will focus on the purely sequential (inhomogeneous) setting, while in the non-uniform case we will focus on Markov chains in random dynamical environments. A large part of the paper is devoted to verifying our main results for Markov chains satisfying a lower Doeblin condition and for Markov chains satisfying a Dobrushin-type contraction condition. We then apply our results in the random environment case to prove estimates on random mixing times as well as limit theorems for Markovian skew products. In fact, we show that one can estimate the $\alpha$-mixing coefficients of the coordinates of the skew product, which opens the door to a variety of limit theorems. Compared with \cite{dolgopyat2023berry}, we are able to prove optimal CLT rates for inhomogeneous Markov chains solely under $\phi$-mixing, without any ellipticity assumptions. Compared with existing results for Markov chains in random ergodic environments, under mixing conditions on the environment, we are able to treat non-uniformly $\phi$-mixing chains, including non-uniform Doeblin/Dobrushin conditions, while all existing results either hold for uniformly mixing chains or are formulated under hard-to-verify conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yeor Hafouta, Brenden Williams. 2025-10-17. Limit theorems for inhomogeneous $\phi$-mixing Markov chains. https://arxiv.org/abs/2510.15323

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