Counterexamples for percolation on unimodular random graphs

DOI10.1090/CONM/719/14465MaRDI QIDQ5236800zbMATH OpenOpenAlexFDO

Authors Omer Angel, Tom Hutchcroft

Publication date 16 October 2019

Published in Unimodularity in Randomly Generated Graphs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.03003, https://authors.library.caltech.edu/111008/

zbMATH Keywords

connectivitynonamenable graphpercolationunimodular random graphsuniqueness

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an infinite cluster at criticality. These examples show that two well-known conjectures of Benjamini and Schramm are false when generalised from transitive graphs to unimodular random rooted graphs.

Recommendations

• On percolation critical probabilities and unimodular random graphs
• Two badly behaved percolation processes on a nonunimodular graph
• Critical percolation on certain nonunimodular graphs
• Percolation on nonunimodular transitive graphs
• Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs

Cites work

• A conjecture concerning a limit of non-Cayley graphs
• Critical percolation on any nonamenable group has no infinite clusters
• Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
• Density and uniqueness in percolation
• scientific article; zbMATH DE number 1405898 (Why is no real title available?)
• scientific article; zbMATH DE number 1421100 (Why is no real title available?)
• Indistinguishability of percolation clusters
• Inequalities with applications to percolation and reliability
• Infinite clusters in percolation models
• Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously
• On percolation critical probabilities and unimodular random graphs
• On the chemical distance for supercritical Bernoulli percolation
• Percolation
• Percolation on nonunimodular transitive graphs
• Probability on trees and networks
• Processes on unimodular random networks
• Shift-coupling of random rooted graphs and networks
• Stability of infinite clusters in supercritical percolation
• Unimodular hyperbolic triangulations: circle packing and random walk
• Uniqueness of percolation on products with Z
• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses

Cited in

(13)

• On percolation critical probabilities and unimodular random graphs
• Finite-energy infinite clusters without anchored expansion
• Percolation on hyperbolic graphs
• On planar graphs of uniform polynomial growth
• Supercritical causal maps: geodesics and simple random walk
• Processes on unimodular random networks
• Two badly behaved percolation processes on a nonunimodular graph
• A counterexample to monotonicity of relative mass in random walks
• Disproof of the conjectured subexponentiality of certain functions in percolation theory
• Unimodular lattice triangulations as small-world and scale-free random graphs
• Unimodularity in randomly generated graphs. AMS special session on unimodularity in randomly generated graphs, Denver, CO, USA, October 8--9, 2016. Proceedings
• Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
• A note on some critical thresholds of Bernoulli percolation

This page was built for publication: Counterexamples for percolation on unimodular random graphs

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