The Small Giant Component in Scale-Free Random Graphs
From MaRDI portal
Publication:5704398
DOI10.1017/S096354830500708XzbMath1079.05092OpenAlexW2080099401MaRDI QIDQ5704398
Publication date: 14 November 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354830500708x
Related Items (10)
Near critical preferential attachment networks have small giant components ⋮ Renormalization-group theory of the abnormal singularities at the critical-order transition in bond percolation on pointed hierarchical graphs ⋮ Epidemics on random intersection graphs ⋮ Sparse random graphs with clustering ⋮ Supercritical percolation on large scale-free random trees ⋮ The contact process on the complete graph with random vertex-dependent infection rates ⋮ Asymptotic equivalence and contiguity of some random graphs ⋮ Thek-Core and Branching Processes ⋮ Large Cliques in a Power-Law Random Graph ⋮ Hitting times for Shamir’s problem
This page was built for publication: The Small Giant Component in Scale-Free Random Graphs