SearcharxivSearch

arXiv · 1904.05283

Scaling Limit of Sub-ballistic 1D Random Walk among Biased Conductances: a Story of Wells and Walls

Abstract

We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the scaling limit of the process is the inverse of an $\alpha$-stable subordinator, which indicates an aging phenomenon, expressed in terms of the generalized arcsine law. In analogy with the case of an i.i.d. random environment studied in details in [Enriquez, Sabot, Zindy, Bull. Soc. Math. 2009; Enriquez, Sabot, Tournier, Zindy, Ann. Appl. Probab. 2013], some `traps' are responsible for the slowdown of the random walk. However, the phenomenology is somehow different (and richer) here. In particular, three types of traps may occur, depending on the fine properties of the tails of the conductances: (i) a very large conductance (a well in the potential); (ii) a very small conductance (a wall in the potential); (iii) the combination of a large conductance followed shortly after by a small conductance (a well-and-wall in the potential).

Explore related subjects

Keep this discovery

BibTeXRIS

Quentin Berger, Michele Salvi. 2019-04-10. Scaling Limit of Sub-ballistic 1D Random Walk among Biased Conductances: a Story of Wells and Walls. https://arxiv.org/abs/1904.05283

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