Percolation on nonunimodular transitive graphs

DOI10.1214/009117906000000494zbMATH Open1114.60083arXivmath/0702875OpenAlexW3105496190MaRDI QIDQ874739FDOQ874739

Authors: Ádám Timár 

Publication date: 10 April 2007

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

Abstract: We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy clusters, this result has already been established, but it also follows from one of our results. We give a general necessary condition for nonunimodular graphs to have a phase with infinitely many heavy clusters. We present an invariant spanning tree with $p_c=1$ on some nonunimodular graph. Such trees cannot exist for nonamenable unimodular graphs. We show a new way of constructing nonunimodular graphs that have properties more peculiar than the ones previously known.

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

Recommendations

• Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
• Critical percolation on certain nonunimodular graphs
• Two badly behaved percolation processes on a nonunimodular graph
• Critical percolation on any nonamenable group has no infinite clusters
• Percolation on hyperbolic graphs

zbMATH Keywords

percolationcritical percolationheavy clusterslight clustersnonunimodular

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability theory on algebraic and topological structures (60B99) Combinatorial probability (60C05) Percolation (82B43)

Cites Work

• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
• Density and uniqueness in percolation
• The critical probability of bond percolation on the square lattice equals 1/2
• Title not available (Why is that?)
• Critical percolation on any nonamenable group has no infinite clusters
• Critical percolation on certain nonunimodular graphs
• Lamplighters, Diestel–Leader Graphs, Random Walks, and Harmonic Functions
• A conjecture concerning a limit of non-Cayley graphs
• Group-invariant percolation on graphs
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Infinite clusters in dependent automorphism invariant percolation on trees
• Title not available (Why is that?)
• The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
• Automorphism groups of graphs as topological groups
• Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
• Phase transitions on nonamenable graphs.
• On non-uniqueness of percolation on nonamenable Cayley graphs
• Neighboring clusters in Bernoulli percolation

Cited In (22)

• Self-avoiding walk on nonunimodular transitive graphs
• Invariant percolation and harmonic Dirichlet functions
• Group-invariant percolation on graphs
• Percolation and isoperimetry on roughly transitive graphs
• Title not available (Why is that?)
• Phase transitions on nonamenable graphs.
• Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
• Title not available (Why is that?)
• Heavy Bernoulli-percolation clusters are indistinguishable
• Critical percolation on certain nonunimodular graphs
• The disk-percolation model on graphs
• The percolation transition in correlated hypergraphs
• Counterexamples for percolation on unimodular random graphs
• Percolation on hyperbolic graphs
• On non-uniqueness of percolation on nonamenable Cayley graphs
• Title not available (Why is that?)
• Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
• Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
• Locality of the critical probability for transitive graphs of exponential growth
• Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
• Sparse graphs: metrics and random models
• Weights of uniform spanning forests on nonunimodular transitive graphs

This page was built for publication: Percolation on nonunimodular transitive graphs

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