SearcharxivSearch

arXiv · 2412.15555

On the rate of convergence in the weak invariance principle for dependent random variables with applications to Markov chains

Abstract

We prove an invariance principle for non-stationary random processes and establish a rate of convergence under a new type of mixing condition. The dependence is exponentially decaying in the gap between the past and the future and is controlled by an assumption on the characteristic function of the finite dimensional increments of the process. The distinct feature of the new mixing condition is that the dependence increases exponentially in the dimension of the increments. The proposed mixing property is particularly suited for processes whose behavior can be described in terms of spectral properties of some related family of operators. Several examples are discussed. We also work out explicit expressions for the constants involved in the bounds. When applied to Markov chains our result specifies the dependence of the constants on the properties of the underlying Banach space and on the initial state of the chain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ion Grama, Émile Le Page, Marc Peigné. 2024-12-20. On the rate of convergence in the weak invariance principle for dependent random variables with applications to Markov chains. https://doi.org/10.4064/cm134-1-1

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