SearcharxivSearch

arXiv · 1412.1068

Self-similar scaling limits of Markov chains on the positive integers

Abstract

We are interested in the asymptotic behavior of Markov chains on the set of positive integers for which, loosely speaking, large jumps are rare and occur at a rate that behaves like a negative power of the current state, and such that small positive and negative steps of the chain roughly compensate each other. If $X_{n}$ is such a Markov chain started at $n$, we establish a limit theorem for $\frac{1}{n}X_{n}$ appropriately scaled in time, where the scaling limit is given by a nonnegative self-similar Markov process. We also study the asymptotic behavior of the time needed by $X_{n}$ to reach some fixed finite set. We identify three different regimes (roughly speaking the transient, the recurrent and the positive-recurrent regimes) in which $X_{n}$ exhibits different behavior. The present results extend those of Haas & Miermont who focused on the case of non-increasing Markov chains. We further present a number of applications to the study of Markov chains with asymptotically zero drifts such as Bessel-type random walks, nonnegative self-similar Markov processes, invariance principles for random walks conditioned to stay positive, and exchangeable coalescence-fragmentation processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Jean Bertoin, Igor Kortchemski. 2014-12-02. Self-similar scaling limits of Markov chains on the positive integers. https://arxiv.org/abs/1412.1068

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