SearcharxivSearch

arXiv · 1503.04117

Random-walk in Beta-distributed random environment

Abstract

We introduce an exactly-solvable model of random walk in random environment that we call the Beta RWRE. This is a random walk in $\mathbb{Z}$ which performs nearest neighbour jumps with transition probabilities drawn according to the Beta distribution. We also describe a related directed polymer model, which is a limit of the $q$-Hahn interacting particle system. Using a Fredholm determinant representation for the quenched probability distribution function of the walker's position, we are able to prove second order cube-root scale corrections to the large deviation principle satisfied by the walker's position, with convergence to the Tracy-Widom distribution. We also show that this limit theorem can be interpreted in terms of the maximum of strongly correlated random variables: the positions of independent walkers in the same environment. The zero-temperature counterpart of the Beta RWRE can be studied in a parallel way. We also prove a Tracy-Widom limit theorem for this model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guillaume Barraquand, Ivan Corwin. 2021-05-17. Random-walk in Beta-distributed random environment. https://doi.org/10.1007/s00440-016-0699-z

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