SearcharxivSearch

arXiv · 1205.5594

Pinning of a random walk by a random walk: proof of a conjecture

Abstract

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the radius of convergence when one walk is averaged over and the other is kept fixed; z2, the radius of convergence when both walks are averaged over. While z2 can be easily computed, no explicit expression is available for z1. In [3] it was conjectured that z1 > z2 under a weak regularity assumption on the random walk. However, this gap was only proved for strongly transient random walk. Subsequently, in [1], [4] and [5] the gap was proved for a subclass of random walks that are transient but not strongly transient. In the present note we settle the full conjecture. The proof is based on a comparison of variational formulas for z1 and z2 derived in [3]. Under additional weak regularity assumptions on the random walk, we derive an upper bound for z1. We further show that the gap persists when the random walk has exponential waiting times. The gaps imply the presence of an intermediate phase for a model of two random walks with a pinning interaction. As explained in [3], they also imply the presence of intermediate phases in three classes of interacting stochastic systems: coupled branching processes, interacting diffusions, and directed polymers with bulk disorder.

Explore related subjects

Keep this discovery

BibTeXRIS

Frank den Hollander, Alex A. Opoku. 2012-05-25. Pinning of a random walk by a random walk: proof of a conjecture. https://arxiv.org/abs/1205.5594

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