1 citations · 5 across the 7 of their papers we have counts for
19 papers
Decorated stable trees
Delphin Sénizergues, Sigurdur Örn Stefánsson, Benedikt Stufler
We define decorated -stable trees which are informally obtained from an -stable tree by blowing up its branchpoints into random metric spaces. This generalizes the -stable…
The scaling limit of random cubic planar graphs
Benedikt Stufler
We study the random simple connected cubic planar graph with an even number of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov sca…
First-passage percolation on random simple triangulations
Benedikt Stufler
We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-p…
The Uniform Infinite Cubic Planar Graph
Benedikt Stufler
We prove that the random simple cubic planar graph with an even number of vertices admits a novel uniform infinite cubic planar graph (UICPG) as quenched local l…
Mass and radius of balls in Gromov-Hausdorff-Prokhorov convergent sequences
Benedikt Stufler
We survey some properties of Gromov--Hausdorff--Prokhorov convergent sequences of random compact metric spaces equipp…
Exact-size Sampling of Enriched Trees in Linear Time
Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler
Various combinatorial classes such as outerplanar graphs and maps, series-parallel graphs, substitution-closed classes of permutations and many more allow bijective encodings by so…