Site percolation on pseudo‐random graphs

DOI10.1002/rsa.21141arXiv2107.13326OpenAlexW3185395174MaRDI QIDQ6076723

Michael Krivelevich, Sahar Diskin

Publication date: 17 October 2023

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

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

zbMATH Keywords

random graphsgiant componentsite percolationpseudo-random graphs

Mathematics Subject Classification ID

Combinatorics (05-XX) Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle factors in sparse pseudo-random graphs
• The phase transition in site percolation on pseudo-random graphs
• Large components in random induced subgraphs of \(n\)-cubes
• Largest random component of a k-cube
• Random minimum length spanning trees in regular graphs
• Percolation on finite graphs and isoperimetric inequalities.
• On the performance of the depth first search algorithm in supercritical random graphs
• The phase transition in random graphs: A simple proof
• Introduction to Random Graphs
• Percolation
• Percolation
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• Paths in graphs
• Asymptotics in percolation on high‐girth expanders
• Expanders – how to find them, and what to find in them
• On the Method of Typical Bounded Differences
• Site Percolation on the d-Dimensional Hamming Torus

This page was built for publication: Site percolation on pseudo‐random graphs