Interlacements and the wired uniform spanning forest (Q1746152): Difference between revisions

The uniform spanning forests of an infinite, locally finite, connected graph \(G\) are defined as weak limits of uniform spanning trees of large finite subgraphs of \(G\). These weak limits can be taken with either free or wired boundary conditions, yielding the free uniform spanning forest and wired uniform spanning forest, respectively. This paper develops a new connection between the wired uniform spanning forest and Sznitman's interlacement process, see [\textit{A.-S. Sznitman}, Ann. Math. (2) 171, No. 3, 2039--2087 (2010; Zbl 1202.60160)]. For an introduction to the extensive literature on the random interlacement process, see [\textit{A. Drewitz} et al., An introduction to random interlacements. Cham: Springer (2014; Zbl 1304.60008)].