PERCOLATION ON GRIGORCHUK GROUPS
From MaRDI portal
Publication:2749047
DOI10.1081/AGB-100001531zbMath1042.20035OpenAlexW2012054212MaRDI QIDQ2749047
Publication date: 2001
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/agb-100001531
finitely generated groupsCayley graphsGrigorchuk groupssite percolationgroups of intermediate growth
Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Asymptotic properties of groups (20F69)
Related Items
Percolation and isoperimetry on roughly transitive graphs, Existence of phase transition for percolation using the Gaussian free field, Gap at 1 for the percolation threshold of Cayley graphs, About the Domino Problem for Subshifts on Groups, SOME GROUP THEORY PROBLEMS, Ramification structures for quotients of the Grigorchuk groups
Cites Work
- Unnamed Item
- Unnamed Item
- Random walks and percolation on trees
- Some infinite \(p\)-groups
- On the Burnside problem for periodic groups
- A system of defining relations for a Grigorchuk group
- Density and uniqueness in percolation
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Random walk on the infinite cluster of the percolation model
- ON THE HILBERT-POINCARÉ SERIES OF GRADED ALGEBRAS ASSOCIATED WITH GROUPS
- DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
- ON THE GROWTH DEGREES OF $ p$-GROUPS AND TORSION-FREE GROUPS
- Cut sets and normed cohomology with applications to percolation
- Markov random fields and percolation on general graphs
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation