Percolation on nonunimodular transitive graphs
From MaRDI portal
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 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.
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
Cites work
- scientific article; zbMATH DE number 1405898 (Why is no real title available?)
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- A conjecture concerning a limit of non-Cayley graphs
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- Automorphism groups of graphs as topological groups
- Critical percolation on any nonamenable group has no infinite clusters
- Critical percolation on certain nonunimodular graphs
- Density and uniqueness in percolation
- Group-invariant percolation on graphs
- Infinite clusters in dependent automorphism invariant percolation on trees
- Lamplighters, Diestel–Leader Graphs, Random Walks, and Harmonic Functions
- Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
- Neighboring clusters in Bernoulli percolation
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Phase transitions on nonamenable graphs.
- The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
- The critical probability of bond percolation on the square lattice equals 1/2
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
Cited in
(24)- Percolation on hyperbolic graphs
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Invariant percolation and harmonic Dirichlet functions
- Locality of the critical probability for transitive graphs of exponential growth
- Weights of uniform spanning forests on nonunimodular transitive graphs
- scientific article; zbMATH DE number 5057503 (Why is no real title available?)
- Critical percolation on certain nonunimodular graphs
- Sparse graphs: metrics and random models
- Group-invariant percolation on graphs
- scientific article; zbMATH DE number 1405898 (Why is no real title available?)
- scientific article; zbMATH DE number 1405897 (Why is no real title available?)
- Percolation and isoperimetry on roughly transitive graphs
- Two badly behaved percolation processes on a nonunimodular graph
- Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
- Phase transitions on nonamenable graphs.
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Self-avoiding walk on nonunimodular transitive graphs
- Heavy Bernoulli-percolation clusters are indistinguishable
- Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
- The disk-percolation model on graphs
- Counterexamples for percolation on unimodular random graphs
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Bernoulli and self-destructive percolation on non-amenable graphs
- The percolation transition in correlated hypergraphs
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)