Percolation and local isoperimetric inequalities

DOI10.1007/S00440-015-0653-5MaRDI QIDQ737324zbMATH OpenOpenAlexFDO

Authors A. Teixeira

Publication date 10 August 2016

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

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

zbMATH Keywords

local isoperimetric inequalitypercolationphase transition

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Abstract: In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then p_c(G) < 1. This gives a partial answer to a question of Benjamini and Schramm. As a consequence of this result we derive, under the additional condition of bounded degree, that these graphs also undergo a non-trivial phase transition for the Ising-Model, the Widom-Rowlinson model and the beach model. Our techniques are also applied to dependent percolation processes with long range correlations. We provide results on the uniqueness of the infinite percolation cluster and quantitative estimates on the size of finite components. Finally we leave some remarks and questions that arise naturally from this work.

Review text

The author considers the site percolation model on a connected graph \(G\) of polynomial growth, which is such that each vertex of \(G\) is kept with probability \(p\) and removed otherwise. The author establishes a partial answer to a question posed by \textit{I. Benjamini} and \textit{O. Schramm} [Electron. Commun. Probab. 1, 71--82 (1996; Zbl 0890.60091)] on the existence of a non-trivial phase transition for the above model. To formulate the main result of the paper, the following definition of the local isoperimetric inequality is introduced. A graph \(G\) is said to satisfy the local isoperimetric inequality if for any sets \(A\subseteq B(x,r):=B\) such that \(| A| \leq | B|/2\) we have \[ |\partial_B A|\geq c| A|^{\frac{d}{d-1}}. \] It is proved that if a graph \(G\) obeys the above inequality with \(d>1\), then the critical probability for the percolation model on \(G\) is \(<1\).

Recommendations

• Percolation on infinite graphs and isoperimetric inequalities
• scientific article; zbMATH DE number 3919519
• Is the critical percolation probability local?
• Inequality of two critical probabilities for percolation
• Critical probabilities for site and bond percolation models

Cites work

• A note on percolation on Z^d: isoperimetric profile via exponential cluster repulsion
• Comparison of Atom and Bond Percolation Processes
• Critical percolation on any nonamenable group has no infinite clusters
• Cut sets and normed cohomology with applications to percolation
• Density and uniqueness in percolation
• Group-invariant percolation on graphs
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• scientific article; zbMATH DE number 806607 (Why is no real title available?)
• Infinite graphs with a nontrivial Bond percolation threshold: some sufficient conditions
• Infinite paths that contain only shortest paths
• Isoperimetric problems for convex bodies and a localization lemma
• Markov random fields and percolation on general graphs
• On the size of a finite vacant cluster of random interlacements with small intensity
• Percolation
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Percolation in the vacant set of Poisson cylinders
• Percolation on infinite graphs and isoperimetric inequalities
• Percolation, perimetry, planarity
• Probability on trees and networks
• Random Walks on Infinite Graphs and Groups
• Rough isometries, and combinatorial approximations of geometries of non- compact Riemannian manifolds
• Uniqueness and non-uniqueness in percolation theory

Cited in

(16)

• Lattices in graphs with polynomial growth
• Percolation and isoperimetry on roughly transitive graphs
• Concentration for locally acting permutations
• Isoperimetry and heat kernel decay on percolation clusters.
• Percolation on infinite graphs and isoperimetric inequalities
• Locality of percolation for abelian Cayley graphs
• Existence of phase transition for percolation using the Gaussian free field
• Transience and anchored isoperimetric dimension of supercritical percolation clusters
• Locality of percolation for graphs with polynomial growth
• Site percolation and isoperimetric inequalities for plane graphs
• Gap at 1 for the percolation threshold of Cayley graphs
• Multi-scale Lipschitz percolation of increasing events for Poisson random walks
• Non-triviality of the phase transition for percolation on finite transitive graphs
• Geometry of Gaussian free field sign clusters and random interlacements
• Effects of ramification and connectivity degree on site percolation threshold on regular lattices and fractal networks
• Lipschitz percolation

This page was built for publication: Percolation and local isoperimetric inequalities

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