Scaling limit of graph classes through split decomposition

Frédérique Bassino; Mathilde Bouvel; Valentin Féray; Lucas Gerin; Adeline Pierrot

Scaling limit of graph classes through split decomposition

Frédérique Bassino
, Mathilde Bouvel
, Valentin Féray
, Lucas Gerin
, Adeline Pierrot

Université Sorbonne Paris Nord
Nancy Université
INRIA Saclay, Laboratoire de Recherche en Informatique (LRI), Université Paris Sud

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that Aldous’ Brownian CRT is the scaling limit, with respect to the Gromov–Prokhorov topology, of uniformly chosen random graphs in each of the three following families of graphs: distance-hereditary graphs, 2-connected distance-hereditary graphs and 3-leaf power graphs. Our approach is based on the split decomposition and on analytic combinatorics.

Original language	English
Pages (from-to)	266-319
Number of pages	54
Journal	Australasian Journal of Combinatorics
Volume	92
Issue number	3
Publication status	Published - 1 Jan 2025

Cite this

@article{b42196d8c094489598528f64af366501,

title = "Scaling limit of graph classes through split decomposition",

abstract = "We prove that Aldous{\textquoteright} Brownian CRT is the scaling limit, with respect to the Gromov–Prokhorov topology, of uniformly chosen random graphs in each of the three following families of graphs: distance-hereditary graphs, 2-connected distance-hereditary graphs and 3-leaf power graphs. Our approach is based on the split decomposition and on analytic combinatorics.",

author = "Fr{\'e}d{\'e}rique Bassino and Mathilde Bouvel and Valentin F{\'e}ray and Lucas Gerin and Adeline Pierrot",

note = "Publisher Copyright: {\textcopyright} The author(s). Released under the CC BY-ND 4.0 International License.",

year = "2025",

month = jan,

day = "1",

language = "English",

volume = "92",

pages = "266--319",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

number = "3",

}

TY - JOUR

T1 - Scaling limit of graph classes through split decomposition

AU - Bassino, Frédérique

AU - Bouvel, Mathilde

AU - Féray, Valentin

AU - Gerin, Lucas

AU - Pierrot, Adeline

N1 - Publisher Copyright: © The author(s). Released under the CC BY-ND 4.0 International License.

PY - 2025/1/1

Y1 - 2025/1/1

N2 - We prove that Aldous’ Brownian CRT is the scaling limit, with respect to the Gromov–Prokhorov topology, of uniformly chosen random graphs in each of the three following families of graphs: distance-hereditary graphs, 2-connected distance-hereditary graphs and 3-leaf power graphs. Our approach is based on the split decomposition and on analytic combinatorics.

AB - We prove that Aldous’ Brownian CRT is the scaling limit, with respect to the Gromov–Prokhorov topology, of uniformly chosen random graphs in each of the three following families of graphs: distance-hereditary graphs, 2-connected distance-hereditary graphs and 3-leaf power graphs. Our approach is based on the split decomposition and on analytic combinatorics.

UR - https://www.scopus.com/pages/publications/105013201418

M3 - Article

AN - SCOPUS:105013201418

SN - 1034-4942

VL - 92

SP - 266

EP - 319

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

IS - 3

ER -

Scaling limit of graph classes through split decomposition

Abstract

Other files and links

Fingerprint

Cite this