Add to ORKG47 pagesWe 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, $2$-connected distance-hereditary graphs and $3$-leaf power graphs. Our approach is based on the split decomposition and on analytic combinatorics
37 pages, 7 figuresWe give alternate constructions of (i) the scaling limit of the uniform connected...
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assig...
In this paper, we consider random plane forests uniformly drawn from all possible plane forests with...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
We study the graph structure of large random dissections of polygons sampled according to Boltzmann ...
We study the graph structure of large random dissections of polygons sampled according to Boltzmann ...
Abstract. We study the uniform random graph Cn with n vertices drawn from a subcritical class of con...
International audienceConsider the minimum spanning tree (MST) of the complete graph with n vertices...
37 pages, 7 figuresWe give alternate constructions of (i) the scaling limit of the uniform connected...
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assig...
In this paper, we consider random plane forests uniformly drawn from all possible plane forests with...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
47 pagesWe prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhor...
We study the graph structure of large random dissections of polygons sampled according to Boltzmann ...
We study the graph structure of large random dissections of polygons sampled according to Boltzmann ...
Abstract. We study the uniform random graph Cn with n vertices drawn from a subcritical class of con...
International audienceConsider the minimum spanning tree (MST) of the complete graph with n vertices...
37 pages, 7 figuresWe give alternate constructions of (i) the scaling limit of the uniform connected...
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assig...
In this paper, we consider random plane forests uniformly drawn from all possible plane forests with...