Random interlacement is a factor of i.i.d

Abstract

The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajectories modulo time-shift on a transient graph $G$. We show that the random interlacement point process on any transient transitive graph $G$ is a factor of i.i.d., i.e., it can be constructed from a family of i.i.d. random variables indexed by vertices of the graph via an equivariant measurable map. Our proof uses a variant of the soft local time method (introduced by Popov and Teixeira) to construct the interlacement point process as the almost sure limit of a sequence of finite-length variants of the model with increasing length. We also discuss a more direct method of proving that the interlacement point process is a factor of i.i.d. which works if and only if $G$ is non-unimodular.

arXiv comment33 pages + Appendix, minor updates compared to previous version (fixed some typos, added more references to the literature)

References in corpus (10)

• Soft local times and decoupling of random interlacements
• Equality of critical parameters for percolation of Gaussian free field level-sets
• Two-dimensional random interlacements and late points for random walks
• Disconnection, random walks, and random interlacements
• Interlacements and the Wired Uniform Spanning Forest
• Random interlacements and amenability
• Invariant Coupling of Determinantal Measures on Sofic Groups
• Uniform even subgraphs and graphical representations of Ising as factors of i.i.d
• Markov chains with exponential return times are finitary
• Entropy-efficient finitary codings