  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.
