Percolation and isoperimetry on roughly transitive graphs
From MaRDI portal
(Redirected from Publication:1633906)
Abstract: In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation phase. The main results of the article work for both dependent and independent percolation processes, since they are based on a quite robust renormalization technique. When G is transitive, the fact that p_c < 1 was already known before. But even in that case our proof yields some new results and it is entirely probabilistic, not involving the use of Gromov's theorem on groups of polynomial growth. We finish the paper giving some examples of dependent percolation for which our results apply.
Recommendations
- Percolation on nonunimodular transitive graphs
- Percolation on infinite graphs and isoperimetric inequalities
- Isoperimetric inequalities and transient random walks on graphs
- Percolation on finite graphs and isoperimetric inequalities.
- Upper bounds for transition probabilities on graphs and isoperimetric inequalities
- Site percolation and isoperimetric inequalities for plane graphs
- On percolation in random graphs with given vertex degrees
- Sharpness for inhomogeneous percolation on quasi-transitive graphs
- scientific article; zbMATH DE number 5722221
Cites work
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- scientific article; zbMATH DE number 3873362 (Why is no real title available?)
- scientific article; zbMATH DE number 3996823 (Why is no real title available?)
- scientific article; zbMATH DE number 806607 (Why is no real title available?)
- A finitary version of Gromov's polynomial growth theorem.
- A new proof of Gromov’s theorem on groups of polynomial growth
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- A note on bounded automorphisms of infinite graphs
- A note on percolation on Z^d: isoperimetric profile via exponential cluster repulsion
- Coarse geometry and randomness. École d'Été de Probabilités de Saint-Flour XLI -- 2011
- Coloring percolation clusters at random.
- Cut sets and normed cohomology with applications to percolation
- Cylinders' percolation in three dimensions
- Density and uniqueness in percolation
- Domination by product measures
- Group-invariant percolation on graphs
- Indicable groups and \(p_c<1\)
- Indistinguishability of percolation clusters
- Infinite paths that contain only shortest paths
- Local Expansion of Symmetrical Graphs
- Markov random fields and percolation on general graphs
- Markovian loop clusters
- Markovian loop clusters on graphs
- On roughly transitive amenable graphs and harmonic Dirichlet functions
- On the critical value function in the divide and color model
- On the structure of groups with polynomial growth
- PERCOLATION ON GRIGORCHUK GROUPS
- Percolation
- Percolation
- Percolation and local isoperimetric inequalities
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Percolation in strongly correlated systems: The massless Gaussian field
- Percolation in the vacant set of Poisson cylinders
- Percolation on infinite graphs and isoperimetric inequalities
- Percolation, perimetry, planarity
- Phase transition in loop percolation
- Probability on trees and networks
- Random Walks on Infinite Graphs and Groups
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Sharpness of the phase transition in percolation models
- The Brownian loop soup
- Uniqueness and non-uniqueness in percolation theory
- Vacant set of random interlacements and percolation
- Vertex-transitive graphs
Cited in
(13)- Transience and anchored isoperimetric dimension of supercritical percolation clusters
- Upper bounds for transition probabilities on graphs and isoperimetric inequalities
- Isoperimetric numbers of randomly perturbed intersection graphs
- Gap at 1 for the percolation threshold of Cayley graphs
- Coexistence of competing first passage percolation on hyperbolic graphs
- Existence of phase transition for percolation using the Gaussian free field
- Percolation on infinite graphs and isoperimetric inequalities
- Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents
- The triangle and the open triangle
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Inhomogeneous percolation on ladder graphs
- Lattices in graphs with polynomial growth
- Multi-scale Lipschitz percolation of increasing events for Poisson random walks
This page was built for publication: Percolation and isoperimetry on roughly transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633906)
