SearcharxivSearch

arXiv · 2401.02782

The *-Vertex Reinforced Jump Process II: random Schr\"odinger representation

Abstract

In this paper we continue the analysis, initiated in the paper *-VRJP I, of the *-Vertex Reinforced Jump Process (*-VRJP), which is a non reversible generalization of the Vertex Reinforced Jump Process (VRJP). More precisely, we give a representation of the *-VRJP in terms of a random Schr\"odinger operator. The corresponding representation for the classical VRJP has proved to be very useful in the understanding of its asymptotic behavior. Several new phenomena and difficulties appear in this non reversible case due to the non exchangeability of the *-VRJP, which becomes exchangeable only after some randomization of the initial local times as proved in the companion paper. The construction is based on several new and rather remarkable identities between integrals on the space of *-symmetric and *-antisymmetric functions on vertices. We give a description of the randomized *-VRJP in terms of that random Schr\"odinger operator, which allow us to prove the representation of the randomized *-VRJP as mixture of Markov jump processes in a different and more analytic way. Similarly as for the VRJP, we think that the representation by a random Schr\"odinger operator and the associated identities are key-features of the *-VRJP.

Explore related subjects

Keep this discovery

BibTeXRIS

Christophe Sabot, Pierre Tarrès. 2024-01-05. The *-Vertex Reinforced Jump Process II: random Schr\"odinger representation. https://arxiv.org/abs/2401.02782

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