Abstract
We introduce random interlacements for transient vertex-reinforced jump processes on a general graph G. Using increasing finite subgraphs Gn of G with wired boundary conditions, we show convergence of the vertex-reinforced jump process on Gn observed in a finite window to the random interlacement observed in the same window.
Original language | English |
---|---|
Pages (from-to) | 1058-1080 |
Number of pages | 23 |
Journal | Annales de l'institut Henri Poincare (B) Probability and Statistics |
Volume | 57 |
Issue number | 2 |
DOIs | |
State | Published - May 2021 |
Keywords
- Random interlacement
- Vertex-reinforced jump process