106 citations · 234 across the 33 of their papers we have counts for
7 papers · 2 filters
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph
Shankar Bhamidi, Nicolas Broutin, Sanchayan Sen +1
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter and a critical time when a…
A new encoding of coalescent processes. Applications to the additive and multiplicative cases
Nicolas Broutin, Jean-François Marckert
We revisit the discrete additive and multiplicative coalescents, starting with particles with unit mass. These cases are known to be related to some "combinatorial coalescent p…
Cutting down -trees and inhomogeneous continuum random trees
Nicolas Broutin, Minmin Wang
We study a fragmentation of the -trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the -trees an…
Reversing the cut tree of the Brownian continuum random tree
Nicolas Broutin, Minmin Wang
Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree . The associated cut tree cut$({\…
Almost optimal sparsification of random geometric graphs
Nicolas Broutin, Luc Devroye, Gabor Lugosi
A random geometric irrigation graph has vertices identified by independent uniformly distributed points in the unit square . Each poi…
Efficiently navigating a random Delaunay triangulation
Nicolas Broutin, Olivier Devillers, Ross Hemsley
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number…