REVIEW 1 cited by
The largest component in a subcritical random graph with a power law degree distribution
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent $\gamma>3$, the largest component is of order $n^{1/(\gamma-1)}$. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distributions. This proves a conjecture by Durrett.
Forward citations
Cited by 1 Pith paper
-
Subcritical percolation and network archaeology on random recursive tree substrate networks
For random recursive trees with independent Erdős–Rényi shortcut edges, subcritical bond percolation exposes a decorated tree structure on which Jordan centrality recovers the root within a deterministic-size confidence set.
Discussion (0). Continue with ORCID to comment.