Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs

DOI10.1214/23-ecp564arXiv2304.09186OpenAlexW4388917417MaRDI QIDQ6177638

Yingxin Mu, Artëm Sapozhnikov

Publication date: 17 January 2024

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.09186

zbMATH Keywords

percolationrandom walkrandom interlacementsamenable graphinfinite connected component

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Cites Work

• Vacant set of random interlacements and percolation
• Uniqueness and non-uniqueness in percolation theory
• On the uniqueness of the infinite cluster of the vacant set of random interlacements
• Interlacement percolation on transient weighted graphs
• Density and uniqueness in percolation
• Random interlacements and amenability
• On the continuity of the percolation probability function
• An Introduction to Random Interlacements
• Equality of critical parameters for percolation of Gaussian free field level sets

This page was built for publication: Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs