Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs
Abstract
We prove the uniqueness of the infinite connected component for the vacant set of random interlacements on general vertex-transitive amenable transient graphs. Our approach is based on connectedness of random interlacements and differs from the one used by Teixera arXiv:0805.4106 to prove the uniqueness of the infinite connected component for the vacant set of random interlacements on Zd.
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.