Percolation through isoperimetry

DOI10.1214/24-AIHP1533MaRDI QIDQ7298080zbMATH OpenFDO

Authors Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich

Publication date 16 July 2026

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

Full work available at URL https://projecteuclid.org/journals/annales-de-linstitut-henri-poincare-probabilites-et-statistiques/volume-62/issue-2/Percolation-through-isoperimetry/10.1214/24-AIHP1533.full

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• Algorithms using local graph features to predict epidemics
• Asymptotics in percolation on high-girth expanders
• Critical percolation on random regular graphs
• Existence of a Percolation Threshold on Finite Transitive Graphs
• Expander graphs and their applications
• Expanders -- how to find them, and what to find in them
• Explicit construction of linear sized tolerant networks
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3826957 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3337135 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Introduction to Random Graphs
• Is the critical percolation probability local?
• Isoperimetric inequalities and supercritical percolation on high-dimensional graphs
• Largest random component of a k-cube
• Locality of random digraphs on expanders
• Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
• Optimal Assignments of Numbers to Vertices
• Percolation
• Percolation
• Percolation on finite graphs and isoperimetric inequalities.
• Percolation on irregular high-dimensional product graphs
• Probability
• Random graphs.
• Random minimum length spanning trees in regular graphs
• Sharp threshold for percolation on expanders
• Supercritical percolation on finite transitive graphs I: uniqueness of the giant component
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• The Evolution of Random Subgraphs of the Cube
• The phase transition in random graphs: a simple proof
• The probabilistic method
• The spectral gap of dense random regular graphs
• The spectral gap of random regular graphs

Cited in

(1)

• Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree

This page was built for publication: Percolation through isoperimetry

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