SearcharxivSearch

arXiv · 2201.05377

Localization of a one-dimensional simple random walk among power-law renewal obstacles

Abstract

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the large-time asymptotics of the quenched survival probability. In the present work we continue our study by describing the behaviour of the random walk conditioned to survive. We prove that with large probability, the walk quickly reaches a unique time-dependent optimal gap that is free from obstacle and gets localized there. We actually establish a dichotomy. If the renewal tail exponent is smaller than one then the walk hits the optimal gap and spends all of its remaining time inside, up to finitely many visits to the bottom of the gap. If the renewal tail exponent is larger than one then the random walk spends most of its time inside of the optimal gap but also performs short outward excursions, for which we provide matching upper and lower bounds on their length and cardinality. Our key tools include a Markov renewal interpretation of the survival probability as well as various comparison arguments for obstacle environments. Our results may also be rephrased in terms of localization properties for a directed polymer among multiple repulsive interfaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Julien Poisat, Francois Simenhaus. 2022-01-14. Localization of a one-dimensional simple random walk among power-law renewal obstacles. https://arxiv.org/abs/2201.05377

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