Percolation on Sparse Random Graphs with Given Degree Sequence

DOI10.1080/15427951.2007.10129148zbMath1206.68234arXivmath/0703269OpenAlexW2142919554MaRDI QIDQ5894145

Nikolaos Fountoulakis

Publication date: 28 February 2011

Published in: Internet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

Metastability of the Potts ferromagnet on random regular graphs ⋮ Heavy-tailed configuration models at criticality ⋮ Preferential attachment without vertex growth: emergence of the giant component ⋮ Critical random graphs and the differential equations technique ⋮ Critical percolation on random regular graphs ⋮ RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ On giant components and treewidth in the layers model ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Susceptible-infected epidemics on evolving graphs ⋮ An old approach to the giant component problem ⋮ Percolation on Random Graphs with a Fixed Degree Sequence ⋮ Critical percolation on random regular graphs

This page was built for publication: Percolation on Sparse Random Graphs with Given Degree Sequence