SearcharxivSearch

arXiv · 1911.02181

Monotonicity and phase transition for the VRJP and the ERRW

Abstract

The vertex-reinforced jump process (VRJP), introduced by Davis and Volkov, is a continuous-time process that tends to come-back to already visited vertices. It is closely linked to the edge-reinforced random walk (ERRW) introduced by Coppersmith and Diaconis in 1986 which is more likely to cross edges it has already crossed. On $\mathbb{Z}^d$ for $d\geq 3$, both models where shown to be recurrent for small enough initial weights (by Sabot, Tarr\`es(2015) and Angel,Crawford,Kozma(2014)) and transient for large enough initial weights (by Disertori,Sabot,Tarr\`es(2015) and Sabot,Tarr\`es(2015)). We show through a coupling of the VRJP for different weights that the VRJP (and the ERRW) exhibits some monotonicity. In particular, we show that increasing the initial weights of the VRJP and the ERRW makes them more transient which means that the recurrence/transience phase transition is necessarily unique. Furthermore, by making the weights go to infinity, we show that the recurrence of the ERRW and the VRJP is implied by the recurrence of a random walk in deterministic electrical network.

Explore related subjects

Keep this discovery

BibTeXRIS

Rémy Poudevigne. 2019-11-06. Monotonicity and phase transition for the VRJP and the ERRW. https://arxiv.org/abs/1911.02181

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