Vertex percolation on expander graphs

DOI10.1016/j.ejc.2008.07.001zbMath1215.05155arXiv0710.2296OpenAlexW2124886183MaRDI QIDQ1003582

Sonny Ben-Shimon, Michael Krivelevich

Publication date: 4 March 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(\beta\)-expander

Mathematics Subject Classification ID

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

Related Items (1)

The sharp threshold for percolation on expander graphs

Cites Work

• Expansion properties of a random regular graph after random vertex deletions
• Scalable secure storage when half the system is faulty
• Percolation on finite graphs and isoperimetric inequalities.
• Mean-field conditions for percolation on finite graphs
• Expander graphs and their applications
• A proof of Alon’s second eigenvalue conjecture and related problems
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex percolation on expander graphs