Scaling limits of random graphs from subcritical classes: extended abstract

zbMATH Open1335.05163MaRDI QIDQ2803343FDOQ2803343

Authors: Benedikt Stufler, Kerstin Weller, Konstantinos Panagiotou 

Publication date: 4 May 2016

Recommendations

• Scaling limits of random graphs from subcritical classes
• Asymptotic properties of random unlabelled block-weighted graphs
• Scaling limits of random trees and graphs
• Asymptotic study of subcritical graph classes
• The continuum limit of critical random graphs

zbMATH Keywords

random graphsscaling limitscontinuum random trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cited In (8)

• Spanning trees in random series-parallel graphs
• Scaling limits of random trees and graphs
• Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
• The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
• Scaling limit for the random walk on the largest connected component of the critical random graph
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
• Scaling limits of random graphs from subcritical classes

This page was built for publication: Scaling limits of random graphs from subcritical classes: extended abstract

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803343)