106 citations · 234 across the 33 of their papers we have counts for
33 papers · 1 filter
Leaf Stripping on Uniform Attachment Trees
Louigi Addario-Berry, Anna Brandenberger, Simon Briend +2
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for…
The scaling limit of critical hypercube percolation
Arthur Blanc-Renaudie, Nicolas Broutin, Asaf Nachmias
We study the connected components in critical percolation on the Hamming hypercube . We show that their sizes rescaled by converge in distribution, and that,…
Convex minorant trees associated with Brownian paths and the continuum limit of the minimum spanning tree
Nicolas Broutin, Jean-François Marckert
We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the…
Increasing paths in random temporal graphs
Nicolas Broutin, Nina Kamčev, Gabor Lugosi
We consider random temporal graphs, a version of the classical Erdős--Rényi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is…
Scaling limits and universality: Critical percolation on weighted graphs converging to an graphon
Jnaneshwar Baslingker, Shankar Bhamidi, Nicolas Broutin +2
We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredie…
Pruning, cut trees, and the reconstruction problem
Nicolas Broutin, Hui He, Minmin Wang
We consider a pruning of the inhomogeneous continuum random trees, as well as the cut trees that encode the genealogies of the fragmentations that come with the pruning. We propose…