Percolation threshold for metric graph loop soup

arXiv2304.08225MaRDI QIDQ6509681FDOQ6509681

Authors: Yinshan Chang, Hang Du, Xinyi Li 

Abstract: In this short note, we show that the critical threshold for the percolation of the Brownian loop soup on a large class of transient metric graphs (including quasi-transitive graphs such as $mathbb{Z}^d$, $dgeq3$) is $1/2$.

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

This page was built for publication: Percolation threshold for metric graph loop soup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509681)