The sharp threshold for percolation on expander graphs

DOI10.2478/S12175-013-0161-YMaRDI QIDQ5746306zbMATH OpenOpenAlexFDO

Authors Yilun Shang

Publication date 18 February 2014

Published in Mathematica Slovaca (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

expander graphpercolationrandom graphsharp threshold

Mathematics Subject Classification ID

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

Recommendations

• Sharp threshold for percolation on expanders
• The giant component after percolation of product graphs
• Percolation on finite graphs and isoperimetric inequalities.
• Asymptotics in percolation on high-girth expanders
• Percolation in general graphs

Cites work

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

Cited in

(22)

• Vertex percolation on expander graphs
• Percolation on finite graphs and isoperimetric inequalities.
• A note on the local weak limit of a sequence of expander graphs
• The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph
• Expansion in supercritical random subgraphs of the hypercube and its consequences
• Percolation on dense graph sequences
• The threshold for jigsaw percolation on random graphs
• Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
• On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
• The Giant Component in a Random Subgraph of a Given Graph
• A Sharp Threshold for Network Reliability
• Asymptotics in percolation on high-girth expanders
• The sharp threshold for jigsaw percolation in random graphs
• Expansion of Percolation Critical Points for Hamming Graphs
• Percolation in general graphs
• The giant component after percolation of product graphs
• Locality of random digraphs on expanders
• Existence of a Percolation Threshold on Finite Transitive Graphs
• Expansion in supercritical random subgraphs of expanders and its consequences
• Sharp threshold for percolation on expanders
• An algorithm to evaluate the spectral expansion
• Edge percolation on a random regular graph of low degree

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

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