arXiv Analytics

Sign in

arXiv:1903.07910 [math.PR]AbstractReferencesReviewsResources

Random interlacements for vertex-reinforced jump processes

Franz Merkl, Silke W. W. Rolles, Pierre Tarrès

Published 2019-03-19Version 1

We introduce random interlacements for transient vertex-reinforced jump processes on a general graph $G$. Using increasing finite subgraphs $G_n$ of $G$ with wired boundary conditions, we show convergence of the vertex-reinforced jump process on $G_n$ observed in a finite window to the random interlacement observed in the same window.

Related articles: Most relevant | Search more
arXiv:0802.3654 [math.PR] (Published 2008-02-25)
Random walk on a discrete torus and random interlacements
arXiv:1101.1527 [math.PR] (Published 2011-01-07, updated 2011-07-18)
Geometry of the random interlacement
arXiv:1012.4711 [math.PR] (Published 2010-12-21, updated 2012-03-16)
Connectivity properties of random interlacement and intersection of random walks