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




Related Items (27)

Excursion theory for Brownian motion indexed by the Brownian treeRandom enriched trees with applications to random graphsAsymptotic properties of random unlabelled block-weighted graphsScaling limits of random Pólya treesA branching process approach to level‐k phylogenetic networksExact-Size Sampling of Enriched Trees in Linear TimeRandom cographs: Brownian graphon limit and asymptotic degree distributionRandom graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023Limits of random tree-like discrete structuresA phase transition in block-weighted random mapsRandom cubic planar graphs converge to the Brownian sphereScaling Limits of Markov-Branching Trees and ApplicationsOn random trees and forestsLocal convergence of random planar graphsThe boundary of random planar maps via looptreesUnnamed ItemInvariance principles for random walks in random environment on treesMaximal independent sets and maximal matchings in series-parallel and related graph classesAsymptotics of integrals of Betti numbers for random simplicial complex processesMaximal independent sets and maximal matchings in series-parallel and related graph classesSelf-similar real trees defined as fixed points and their geometric propertiesRandom graphs from a block-stable classSubcritical Graph Classes Containing All Planar GraphsGraph limits of random graphs from a subset of connected k‐treesUniversal height and width bounds for random treesEnumeration of chordal planar graphs and mapsOn local weak limit and subgraph counts for sparse random graphs




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