Random interlacements for vertex-reinforced jump processes
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.