REVIEW 1 cited by
Universality for critical heavy-tailed network models: Metric structure of maximal components
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
read the original abstract
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such results were derived by Bhamidi, van der Hofstad, Sen [Probab. Theory Relat. Fields 2018]. We develop general principles under which the identical scaling limits as the rank-one case can be obtained. Of independent interest, we derive refined asymptotics for various susceptibility functions and the maximal diameter in the barely subcritical regime.
Forward citations
Cited by 1 Pith paper
-
On breadth-first constructions of scaling limits of random graphs and random unicellular maps
The scaling limits of uniform connected graphs with fixed surplus and of random unicellular maps are built from tilted Brownian trees by identifying points at common heights sampled via local time.
Discussion (0). Continue with ORCID to comment.