Percolation on Sparse Random Graphs with Given Degree Sequence
From MaRDI portal
Publication:5892552
DOI10.1080/15427951.2007.10129148zbMath1238.05246OpenAlexW2142919554MaRDI QIDQ5892552
Publication date: 21 June 2011
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2007.10129148
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Vertex degrees (05C07)
Related Items (8)
Mesoscopic scales in hierarchical configuration models ⋮ Critical percolation on scale-free random graphs: new universality class for the configuration model ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ Locality of random digraphs on expanders ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Nonuniversality of weighted random graphs with infinite variance degree ⋮ Infinite and Giant Components in the Layers Percolation Model ⋮ Global lower mass-bound for critical configuration models in the heavy-tailed regime
This page was built for publication: Percolation on Sparse Random Graphs with Given Degree Sequence
