The following pages link to Nicolas Broutin (Q328789):
Displaying 48 items.
- A new encoding of coalescent processes: applications to the additive and multiplicative cases (Q328790) (← links)
- Almost optimal sparsification of random geometric graphs (Q350709) (← links)
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- Cutting down trees with a Markov chainsaw (Q473156) (← links)
- On combinatorial testing problems (Q605939) (← links)
- Critical random graphs: limiting constructions and distributional properties (Q638299) (← links)
- Total progeny in killed branching random walk (Q644779) (← links)
- The total path length of split trees (Q691101) (← links)
- Note on the structure of Kruskal's algorithm (Q848958) (← links)
- Large deviations for the weighted height of an extended class of trees (Q866962) (← links)
- (Q934909) (redirect page) (← links)
- Weighted height of random trees (Q934911) (← links)
- The scaling limit of the minimum spanning tree of the complete graph (Q1681600) (← links)
- Bounded monochromatic components for random graphs (Q1750660) (← links)
- Self-similar real trees defined as fixed points and their geometric properties (Q2042861) (← links)
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems (Q2067661) (← links)
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs (Q2083254) (← links)
- A limit field for orthogonal range searches in two-dimensional random point search trees (Q2274287) (← links)
- The dual tree of a recursive triangulation of the disk (Q2338914) (← links)
- Effective resistance of random trees (Q2389604) (← links)
- Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees (Q2405112) (← links)
- Reversing the cut tree of the Brownian continuum random tree (Q2411872) (← links)
- The continuum limit of critical random graphs (Q2428503) (← links)
- Connectivity of sparse Bluetooth networks (Q2517276) (← links)
- Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
- Connectivity threshold of Bluetooth graphs (Q2874082) (← links)
- (Q2900354) (← links)
- The height of random binary unlabelled trees (Q2959857) (← links)
- Critical random graphs and the structure of a minimum spanning tree (Q3055778) (← links)
- The distribution of height and diameter in random non-plane binary trees (Q3165458) (← links)
- Longest Path Distance in Random Circuits (Q3168445) (← links)
- An Analysis of the Height of Tries with Random Weights on the Edges (Q3512599) (← links)
- The Longest Minimum-Weight Path in a Complete Graph (Q3557522) (← links)
- (Q3574996) (← links)
- (Q3576768) (← links)
- And/or trees: A local limit point of view (Q4684326) (← links)
- The combinatorics of the colliding bullets (Q5113944) (← links)
- Recursive functions on conditional Galton‐Watson trees (Q5136916) (← links)
- Asymptotics of trees with a prescribed degree sequence and applications (Q5415593) (← links)
- Partial match queries in random quadtrees (Q5743457) (← links)
- The height of increasing trees (Q5900175) (← links)
- Critical random graphs: limiting constructions and distributional properties (Q6215166) (← links)
- Limit law for number of components of fixed sizes of graphs with degree one or two (Q6256170) (← links)
- Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\H{o}s-R\'enyi random graph (Q6256372) (← links)
- Pruning, cut trees, and the reconstruction problem (Q6415051) (← links)
- Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon (Q6429965) (← links)
- Increasing paths in random temporal graphs (Q6440838) (← links)
- Convex minorant trees associated with Brownian paths and the continuum limit of the minimum spanning tree (Q6444785) (← links)