CRITICAL PERCOLATION OF FREE PRODUCT OF GROUPS

DOI10.1142/S0218196708004524MaRDI QIDQ3519802zbMATH OpenFDO

Authors Iva Kozakova

Publication date 19 August 2008

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphscritical percolationfree products of groupscluster sizes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Percolation (82B43) Probabilistic methods in group theory (20P05)

Abstract: In this article we study percolation on the Cayley graph of a free product of groups. The critical probability $p_c$ of a free product $G_1\ast G_2\ast \mathrm{...}\ast G_n$ of groups is found as a solution of an equation involving only the expected subcritical cluster size of factor groups $G_1,G_2,\mathrm{...},G_n$. For finite groups these equations are polynomial and can be explicitly written down. The expected subcritical cluster size of the free product is also found in terms of the subcritical cluster sizes of the factors. In particular, we prove that $p_c$ for the Cayley graph of the modular group $hbox{PSL}_2(mathbbZ)$ (with the standard generators) is $\mathrm{.5199...}$, the unique root of the polynomial $2p^5-6p^4+2p^3+4p^2-1$ in the interval $(0,1)$. In the case when groups $G_i$ can be "well approximated" by a sequence of quotient groups, we show that the critical probabilities of the free product of these approximations converge to the critical probability of $G_1\ast G_2\ast \mathrm{...}\ast G_n$ and the speed of convergence is exponential. Thus for residually finite groups, for example, one can restrict oneself to the case when each free factor is finite. We show that the critical point, introduced by Schonmann, $p_{mathrmexp}$ of the free product is just the minimum of $p_{mathrmexp}$ for the factors.

Recommendations

• Critical percolation of virtually free groups and other tree-like graphs
• Cut sets and normed cohomology with applications to percolation
• PERCOLATION ON GRIGORCHUK GROUPS
• Critical percolation on any nonamenable group has no infinite clusters
• Percolation on Finite Cayley Graphs

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• Critical exponents for two-dimensional percolation
• Invariant percolation and harmonic Dirichlet functions
• Mean-field criticality for percolation on planar non-amenable graphs
• Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
• On non-uniqueness of percolation on nonamenable Cayley graphs
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Random walks, capacity and percolation on trees
• Sharpness of the phase transition in percolation models
• The critical probability of bond percolation on the square lattice equals 1/2
• Tree graph inequalities and critical behavior in percolation models
• Tree-graded spaces and asymptotic cones of groups. (With an appendix by Denis Osin and Mark Sapir).

Cited in

(4)

• Critical percolation of virtually free groups and other tree-like graphs
• Fixed price of groups and percolation
• Counting self-avoiding walks on free products of graphs
• Arm exponents in high dimensional percolation

This page was built for publication: CRITICAL PERCOLATION OF FREE PRODUCT OF GROUPS

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