Critical percolation of virtually free groups and other tree-like graphs
Iva \v{S}pakulov\'a

TL;DR
This paper introduces a method to determine the critical probability for percolation on tree-like graphs, including Cayley graphs of virtually free groups, using branching processes and algebraic computations.
Contribution
It develops a novel approach linking percolation thresholds to multi-type Galton--Watson processes on tree-like structures, enabling explicit calculations of critical probabilities.
Findings
Provides a method to compute $p_c$ using the first-moment matrix.
Shows $p_c$ is algebraic when pieces are finite.
Applies the method to Cayley graphs of virtually free groups.
Abstract
This article presents a method for finding the critical probability for the Bernoulli bond percolation on graphs with the so-called tree-like structure. Such a graph can be decomposed into a tree of pieces, each of which has finitely many isomorphism classes. This class of graphs includes the Cayley graphs of amalgamated products, HNN extensions or general groups acting on trees. It also includes all transitive graphs with more than one end. The idea of the method is to find a multi-type Galton--Watson branching process (with a parameter ) which has finite expected population size if and only if the expected percolation cluster size is finite. This provides sufficient information about . In particular, if the pairwise intersections of pieces are finite, then is the smallest positive such that , where is the first-moment matrix of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
