Scaling limit of graph classes through split decomposition
Probability
2022-07-26 v1 Combinatorics
Abstract
We prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhorov topology, of uniform random graphs in each of the three following families of graphs: distance-hereditary graphs, -connected distance-hereditary graphs and -leaf power graphs. Our approach is based on the split decomposition and on analytic combinatorics.
Keywords
Cite
@article{arxiv.2207.12253,
title = {Scaling limit of graph classes through split decomposition},
author = {Frédérique Bassino and Mathilde Bouvel and Valentin Féray and Lucas Gerin and Adeline Pierrot},
journal= {arXiv preprint arXiv:2207.12253},
year = {2022}
}
Comments
47 pages