Scaling limits of random graphs from subcritical classes
From MaRDI portal
Publication:341486
DOI10.1214/15-AOP1048zbMath1360.60073arXiv1411.1865OpenAlexW2963933916MaRDI QIDQ341486
Benedikt Stufler, Kerstin Weller, Konstantinos D. Panagiotou
Publication date: 16 November 2016
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1865
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)
Related Items (27)
Excursion theory for Brownian motion indexed by the Brownian tree ⋮ Random enriched trees with applications to random graphs ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Scaling limits of random Pólya trees ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Random cographs: Brownian graphon limit and asymptotic degree distribution ⋮ Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023 ⋮ Limits of random tree-like discrete structures ⋮ A phase transition in block-weighted random maps ⋮ Random cubic planar graphs converge to the Brownian sphere ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ On random trees and forests ⋮ Local convergence of random planar graphs ⋮ The boundary of random planar maps via looptrees ⋮ Unnamed Item ⋮ Invariance principles for random walks in random environment on trees ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Asymptotics of integrals of Betti numbers for random simplicial complex processes ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Self-similar real trees defined as fixed points and their geometric properties ⋮ Random graphs from a block-stable class ⋮ Subcritical Graph Classes Containing All Planar Graphs ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ Universal height and width bounds for random trees ⋮ Enumeration of chordal planar graphs and maps ⋮ On local weak limit and subgraph counts for sparse random graphs
This page was built for publication: Scaling limits of random graphs from subcritical classes