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.