SearcharxivSearch

arXiv · 2403.14826

Subexponential lower bounds for $f$-ergodic Markov processes

Abstract

We provide a criterion for establishing lower bounds on the rate of convergence in $f$-variation of a continuous-time ergodic Markov process to its invariant measure. The criterion consists of novel super- and submartingale conditions for certain functionals of the Markov process. It provides a general approach for proving lower bounds on the tails of the invariant measure and the rate of convergence in $f$-variation of a Markov process, analogous to the widely used Lyapunov drift conditions for upper bounds. Our key technical innovation produces lower bounds on the tails of the heights and durations of the excursions from bounded sets of a continuous-time Markov process using path-wise arguments. We apply our theory to elliptic diffusions and L\'evy-driven stochastic differential equations with known polynomial/stretched exponential upper bounds on their rates of convergence. Our lower bounds match asymptotically the known upper bounds for these classes of models, thus establishing their rate of convergence to stationarity. The generality of the approach suggests that, analogous to the Lyapunov drift conditions for upper bounds, our methods can be expected to find applications in many other settings.

Explore related subjects

Keep this discovery

BibTeXRIS

Miha Brešar, Aleksandar Mijatović. 2024-03-21. Subexponential lower bounds for $f$-ergodic Markov processes. https://arxiv.org/abs/2403.14826

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