Critical percolation of virtually free groups and other tree-like graphs

DOI10.1214/09-AOP458zbMATH Open1206.60093arXiv0801.4153OpenAlexW3101819382WikidataQ60228916 ScholiaQ60228916MaRDI QIDQ971940FDOQ971940

Authors: Iva Špakulová 

Publication date: 17 May 2010

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: This article presents a method for finding the critical probability $p_c$ 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 $p$) which has finite expected population size if and only if the expected percolation cluster size is finite. This provides sufficient information about $p_c$. In particular, if the pairwise intersections of pieces are finite, then $p_c$ is the smallest positive $p$ such that $operatornamedet(M-1)=0$, where $M$ is the first-moment matrix of the branching process. If the pieces of the tree-like structure are finite, then $p_c$ is an algebraic number and we give an algorithm computing $p_c$ as a root of some algebraic function. We show that any Cayley graph of a virtually free group (i.e., a group acting on a tree with finite vertex stabilizers) with respect to any finite generating set has a tree-like structure with finite pieces. In particular, we show how to compute $p_c$ for the Cayley graph of a free group with respect to any finite generating set.

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

Recommendations

• CRITICAL PERCOLATION OF FREE PRODUCT OF GROUPS
• scientific article; zbMATH DE number 2019627
• Percolation on Finite Cayley Graphs
• Locality of percolation for abelian Cayley graphs
• PERCOLATION ON GRIGORCHUK GROUPS

zbMATH Keywords

bond percolationspecial linear groupvirtually free groupsrandom processes on graphs

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probabilistic methods in group theory (20P05)

Cites Work

• General Irreducible Markov Chains and Non-Negative Operators
• Percolation
• Sharpness of the phase transition in percolation models
• Title not available (Why is that?)
• The critical probability of bond percolation on the square lattice equals 1/2
• Exact bond percolation thresholds in two dimensions
• Cutting up graphs
• Title not available (Why is that?)
• CRITICAL PERCOLATION OF FREE PRODUCT OF GROUPS

Cited In (3)

• Global survival of branching random walks and tree-like branching random walks
• Counting self-avoiding walks on free products of graphs
• CRITICAL PERCOLATION OF FREE PRODUCT OF GROUPS

This page was built for publication: Critical percolation of virtually free groups and other tree-like graphs

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