SearcharxivSearch

arXiv · 1103.1780

A crossover for the bad configurations of random walk in random scenery

Abstract

In this paper, we consider a random walk and a random color scenery on Z. The increments of the walk and the colors of the scenery are assumed to be i.i.d. and to be independent of each other. We are interested in the random process of colors seen by the walk in the course of time. Bad configurations for this random process are the discontinuity points of the conditional probability distribution for the color seen at time zero given the colors seen at all later times. We focus on the case where the random walk has increments 0, +1 or -1 with probability epsilon, (1-epsilon)p and (1-epsilon)(1-p), respectively, with p in [1/2,1] and epsilon in [0,1), and where the scenery assigns the color black or white to the sites of Z with probability 1/2 each. We show that, remarkably, the set of bad configurations exhibits a crossover: for epsilon=0 and p in (1/2,4/5) all configurations are bad, while for (p,epsilon) in an open neighborhood of (1,0) all configurations are good. In addition, we show that for epsilon=0 and p=1/2 both bad and good configurations exist. We conjecture that for all epsilon in [0,1) the crossover value is unique and equals 4/5. Finally, we suggest an approach to handle the seemingly more difficult case where epsilon>0 and p in [1/2,4/5), which will be pursued in future work.

Explore related subjects

Keep this discovery

BibTeXRIS

Sébastien Blachère, Frank den Hollander, Jeffrey E. Steif. 2011-12-08. A crossover for the bad configurations of random walk in random scenery. https://doi.org/10.1214/11-aop664

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