Percolation and isoperimetry on roughly transitive graphs

From MaRDI portal
Publication:1633906

DOI10.1214/17-AIHP857zbMATH Open1417.60078arXiv1507.07765OpenAlexW2963161811WikidataQ129083970 ScholiaQ129083970MaRDI QIDQ1633906FDOQ1633906


Authors: Elisabetta Candellero, A. Teixeira Edit this on Wikidata


Publication date: 21 December 2018

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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.


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




Recommendations




Cites Work


Cited In (13)





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)