On limits of sparse random graphs

DOI10.1016/j.endm.2016.09.059zbMath1356.05137OpenAlexW2532960282MaRDI QIDQ510626

Lluís Vena

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.059

zbMATH Keywords

ordered setsHardy fieldslimits of graphslimits of random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Recurrence of distributional limits of finite planar graphs
• Upper tails for subgraph counts in random graphs
• A note on Fiedler value of classes with sublinear separators
• Poisson approximation for large deviations
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: On limits of sparse random graphs