Percolation on finite graphs and isoperimetric inequalities.
From MaRDI portal
Publication:1878979
DOI10.1214/009117904000000414zbMath1046.05071arXivmath/0207112OpenAlexW3098555975MaRDI QIDQ1878979
Itai Benjamini, Alan M. Stacey, Noga Alon
Publication date: 15 September 2004
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0207112
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Rapid social connectivity, Critical Parameters for Loop and Bernoulli Percolation, Mean-field conditions for percolation on finite graphs, The mixing time of the giant component of a random graph, On the percolative properties of the intersection of two independent interlacements, Universality for critical heavy-tailed network models: metric structure of maximal components, Extreme values for two-dimensional discrete Gaussian free field, The giant component after percolation of product graphs, Giant component for the supercritical level‐set percolation of the Gaussian free field on regular expander graphs, Site percolation on pseudo‐random graphs, Percolation and epidemic processes in one-dimensional small-world networks (extended abstract), The probability of unusually large components for critical percolation on random \(d\)-regular graphs, Locality of random digraphs on expanders, On the critical parameter of interlacement percolation in high dimension, A modification of the random cutting model, Unnamed Item, Random subshifts of finite type, Metastability of the Potts ferromagnet on random regular graphs, Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs, Phase transition of degeneracy in minor-closed families, Giant vacant component left by a random walk in a random \(d\)-regular graph, Shadows of ordered graphs, Conformally invariant scaling limits in planar critical percolation, Scale-invariant groups., Asymptotics in percolation on high‐girth expanders, Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees, Expansion properties of a random regular graph after random vertex deletions, Sharp threshold for percolation on expanders, On percolation and ‐hardness, Entanglement entropy in the quantum networks of a coupled quantum harmonic oscillator, Edge percolation on a random regular graph of low degree, A phase transition for the metric distortion of percolation on the hypercube, Generalized loop‐erased random walks and approximate reachability, Hypercube percolation, Component Games on Regular Graphs, Giant component and vacant set for random walk on a discrete torus, Percolation on dense graph sequences, Level-set percolation of the Gaussian free field on regular graphs II: finite expanders, Is the critical percolation probability local?, A lower bound on the critical parameter of interlacement percolation in high dimension, Critical percolation on random regular graphs, Algebraic bounds for heterogeneous site percolation on directed and undirected graphs, Vertex percolation on expander graphs, Random Graphs with a Fixed Maximum Degree, Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs, A note on the local weak limit of a sequence of expander graphs, The random cluster model on the complete graph via large deviations, Critical window for the vacant set left by random walk on random regular graphs, On the expected total number of infections for virus spread on a finite network, Critical percolation on random regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean-field critical behaviour for percolation in high dimensions
- Random walks on graphs with a strong isoperimetric property
- Explicit construction of linear sized tolerant networks
- Largest random component of a k-cube
- On the geometry of random Cantor sets and fractal percolation
- Percolation in high dimensions
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Tolerating a linear number of faults in networks of bounded degree
- Domination by product measures
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Indistinguishability of percolation clusters
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Phase transitions on nonamenable graphs
- The Evolution of Random Graphs
- A parallel algorithmic version of the local lemma
- Local Expansion of Symmetrical Graphs
- Every monotone graph property has a sharp threshold
- The contact process on finite homogeneous trees