1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Sweet Trims are made of Threes: A càdlàg erasure of the Brownian tree
Alessandra Caraceni, Nicolas Curien, William Fleurat +1
We present a simple trimming algorithm that generates nested uniform binary plane trees by removing leaves one-by-one using a best-of-three-match procedure. While its one-step tran…
Growing Self-Similar Markov Trees
Nicolas Curien, William Fleurat, Adrianus Twigt
Can we obtain a Brownian CRT of mass from a CRT of mass by cutting certain branches? In this paper, we will answer that question in the much more general setting of self-…
A Tauberian approach to metric scaling limits of random discrete structures, with an application to random planar maps
William Fleurat
We prove sandwich theorems and a Tauberian theorem in the space of compact metric measure spaces, endowed with the Gromov-Hausdorff-Prokhorov (GHP) topology. These results hold wit…
Growing conditioned BGW trees with log-concave offspring distributions
William Fleurat
We show that given a log-concave offspring distribution, the corresponding sequence of Bienaymé-Galton-Watson trees conditioned to have vertices admits a realization as a…
A phase transition in block-weighted random maps
William Fleurat, Zéphyr Salvy
We consider the model of random planar maps of size biased by a weight per -connected block, and the closely related model of random planar quadrangulations of size $n…