SearcharxivSearch

arXiv · 2203.02534

Discrete self-similar and ergodic Markov chains

Abstract

The first aim of this paper is to introduce a class of Markov chains on $\mathbb{Z}_+$ which are discrete self-similar in the sense that their semigroups satisfy an invariance property expressed in terms of a discrete random dilation operator. After showing that this latter property requires the chains to be upward skip-free, we first establish a gateway relation, a concept introduced in [26], between the semigroup of such chains and the one of spectrally negative self-similar Markov processes on $\mathbb{R}_+$. As a by-product, we prove that each of these Markov chains, after an appropriate scaling, converge in the Skorohod metric, to the associated self-similar Markov process. By a linear perturbation of the generator of these Markov chains, we obtain a class of ergodic Markov chains, which are non-reversible. By means of intertwining and interweaving relations, where the latter was recently introduced in [27], we derive several deep analytical properties of such ergodic chains including the description of the spectrum, the spectral expansion of their semigroups, the study of their convergence to equilibrium in the $\Phi$-entropy sense as well as their hypercontractivity property.

Explore related subjects

Keep this discovery

BibTeXRIS

Laurent Miclo, Pierre Patie, Rohan Sarkar. 2022-03-04. Discrete self-similar and ergodic Markov chains. https://arxiv.org/abs/2203.02534

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