The sharp threshold for percolation on expander graphs

DOI10.2478/s12175-013-0161-yzbMath1324.60083OpenAlexW2020060447MaRDI QIDQ5746306

Yilun Shang

Publication date: 18 February 2014

Published in: Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s12175-013-0161-y

zbMATH Keywords

percolationsharp thresholdrandom graphexpander graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Asymptotic behaviour of estimates of link probability in random networks
• Sharp threshold for percolation on expanders
• Threshold for monotone symmetric properties through a logarithmic Sobolev inequality
• Expansion properties of a random regular graph after random vertex deletions
• Edge percolation on a random regular graph of low degree
• Vertex percolation on expander graphs
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Phase transitions on nonamenable graphs

This page was built for publication: The sharp threshold for percolation on expander graphs