Követés
Nicolas Broutin
Nicolas Broutin
Sorbonne Université
E-mail megerősítve itt: sorbonne-universite.fr - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
The continuum limit of critical random graphs
L Addario-Berry, N Broutin, C Goldschmidt
Probability Theory and Related Fields 152 (3), 367-406, 2012
1732012
On combinatorial testing problems
L Addario-Berry, N Broutin, L Devroye, G Lugosi
1542010
The scaling limit of the minimum spanning tree of the complete graph
L Addario-Berry, N Broutin, C Goldschmidt, G Miermont
1142017
Critical random graphs: limiting constructions and distributional properties
L Addario-Berry, N Broutin, C Goldschmidt
762010
Asymptotics of trees with a prescribed degree sequence and applications
N Broutin, JF Marckert
Random Structures & Algorithms 44 (3), 290-316, 2014
562014
Large deviations for the weighted height of an extended class of trees
N Broutin, L Devroye
Algorithmica 46, 271-297, 2006
542006
Scaling limits and universality: Critical percolation on weighted graphs converging to an graphon
J Baslingker, S Bhamidi, N Broutin, S Sen, X Wang
arXiv preprint arXiv:2303.10082, 2023
49*2023
Cutting down trees with a Markov chainsaw
L Addario-Berry, N Broutin, C Holmgren
492014
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
42*2021
The height of increasing trees
N Broutin, L Devroye, E McLeish, M de la Salle
Random Structures & Algorithms 32 (4), 494-518, 2008
412008
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
292016
The distribution of height and diameter in random non‐plane binary trees
N Broutin, P Flajolet
Random Structures & Algorithms 41 (2), 215-252, 2012
272012
Note on the Structure of Kruskal’s Algorithm
N Broutin, L Devroye, E McLeish
Algorithmica 56, 141-159, 2010
262010
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
252009
Total progeny in killed branching random walk
L Addario-Berry, N Broutin
Probability theory and related fields 151, 265-295, 2011
232011
Connectivity threshold of Bluetooth graphs
N Broutin, L Devroye, N Fraiman, G Lugosi
Random Structures & Algorithms 44 (1), 45-66, 2014
222014
The longest minimum-weight path in a complete graph
L Addario-Berry, N Broutin, G Lugosi
Combinatorics, Probability and Computing 19 (1), 1-19, 2010
222010
The total path length of split trees
N Broutin, C Holmgren
The Annals of Applied Probability, 1745-1777, 2012
202012
The diameter of the minimum spanning tree of a complete graph
L Addario-Berry, N Broutin, B Reed
Discrete Mathematics & Theoretical Computer Science, 2006
202006
Limits of multiplicative inhomogeneous random graphs and Lévy trees: The continuum graphs
N Broutin, T Duquesne, M Wang
The Annals of Applied Probability 32 (4), 2448-2503, 2022
19*2022
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20