Asymptotics in percolation on high‐girth expanders

DOI10.1002/rsa.20903zbMath1455.05041arXiv1803.11553OpenAlexW2999405757WikidataQ126397738 ScholiaQ126397738MaRDI QIDQ5128747

Michael Krivelevich, Eyal Lubetzky, Benjamin Sudakov

Publication date: 26 October 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

bond percolationgiant componentcomponent sizeshigh-girth expanders

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Distance in graphs (05C12) Density (toughness, etc.) (05C42) Expander graphs (05C48)

Related Items

Crux and Long Cycles in Graphs ⋮ Giant component for the supercritical level‐set percolation of the Gaussian free field on regular expander graphs ⋮ Site percolation on pseudo‐random graphs ⋮ Locality of random digraphs on expanders ⋮ Metastability of the Potts ferromagnet on random regular graphs ⋮ Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs ⋮ Level-set percolation of the Gaussian free field on regular graphs II: finite expanders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Is the critical percolation probability local?
• Edge percolation on a random regular graph of low degree
• Random minimum length spanning trees in regular graphs
• Percolation on finite graphs and isoperimetric inequalities.
• Anatomy of the giant component: the strictly supercritical regime
• Random Graphs and Complex Networks
• Critical percolation on random regular graphs
• Anatomy of a young giant component in the random graph
• Long paths and Hamiltonicity in random graphs
• Euclidean vs. Graph Metric