Segui
Nicolas Broutin
Nicolas Broutin
Sorbonne UniversitÚ
Email verificata su upmc.fr - Home page
Titolo
Citata da
Citata da
Anno
The continuum limit of critical random graphs
L Addario-Berry, N Broutin, C Goldschmidt
Probability Theory and Related Fields 152 (3-4), 367-406, 2012
1512012
On combinatorial testing problems
L Addario-Berry, N Broutin, L Devroye, G Lugosi
1422010
The scaling limit of the minimum spanning tree of the complete graph
L Addario-Berry, N Broutin, C Goldschmidt, G Miermont
972017
Critical random graphs: limiting constructions and distributional properties
L Addario-Berry, N Broutin, C Goldschmidt
642010
Large deviations for the weighted height of an extended class of trees
N Broutin, L Devroye
Algorithmica 46, 271-297, 2006
532006
Cutting down trees with a Markov chainsaw
L Addario-Berry, N Broutin, C Holmgren
492014
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\H {o} sR\'enyi random graph
S Bhamidi, N Broutin, S Sen, X Wang
arXiv preprint arXiv:1411.3417, 2014
462014
Asymptotics of trees with a prescribed degree sequence and applications
N Broutin, JF Marckert
Random Structures & Algorithms 44 (3), 290-316, 2014
422014
The height of increasing trees
N Broutin, L Devroye, E McLeish, M de la Salle
Random Structures & Algorithms 32 (4), 494-518, 2008
392008
A new encoding of coalescent processes: applications to the additive and multiplicative cases
N Broutin, JF Marckert
Probability Theory and Related Fields 166, 515-552, 2016
272016
The distribution of height and diameter in random non‐plane binary trees
N Broutin, P Flajolet
Random Structures & Algorithms 41 (2), 215-252, 2012
262012
Limits of multiplicative inhomogeneous random graphs and LÚvy trees: Limit theorems
N Broutin, T Duquesne, M Wang
Probability Theory and Related Fields 181, 865-973, 2021
232021
Connectivity threshold of Bluetooth graphs
N Broutin, L Devroye, N Fraiman, G Lugosi
Random Structures & Algorithms 44 (1), 45-66, 2014
232014
Total progeny in killed branching random walk
L Addario-Berry, N Broutin
Probability theory and related fields 151, 265-295, 2011
222011
Critical random graphs and the structure of a minimum spanning tree
L Addario‐Berry, N Broutin, B Reed
Random Structures & Algorithms 35 (3), 323-347, 2009
222009
The diameter of the minimum spanning tree of a complete graph
L Addario-Berry, N Broutin, B Reed
Discrete Mathematics and Theoretical Computer Science, 237-248, 2006
212006
The total path length of split trees
N Broutin, C Holmgren
192012
The height of random binary unlabelled trees
N Broutin, P Flajolet
arXiv preprint arXiv:0807.2365, 2008
182008
Cutting down -trees and inhomogeneous continuum random trees
N Broutin, M Wang
172017
Note on the Structure of Kruskal’s Algorithm
N Broutin, L Devroye, E McLeish
Algorithmica 56, 141-159, 2010
172010
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20