29 results  save search


hal-01220798v1  Journal articles
L. Addario-BerryNicolas Broutin. Total progeny in killed branching random walk
Probability Theory and Related Fields, Springer Verlag, 2011, 151, pp.265-295. ⟨10.1007/s00440-010-0299-2⟩
...
inria-00510232v1  Documents associated with scientific events
Nicolas Broutin. Les distances dans les arbres couvrants minimaux
Journées MAS et Journée en l'honneur de Jacques Neveu, Aug 2010, Talence, France
...
tel-00842019v1  Habilitation à diriger des recherches
Nicolas Broutin. Random trees, graphs and recursive partitions
Probability [math.PR]. Université Pierre et Marie Curie - Paris VI, 2013
hal-00773364v1  Journal articles
Louigi Addario-BerryNicolas BroutinCecilia Holmgren. Cutting down trees with a Markov chainsaw
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2014, 24 (6), pp.2297-2339. ⟨10.1214/13-AAP978⟩
hal-00773367v1  Journal articles
Nicolas BroutinCecilia Holmgren. The total path length of split trees
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2012, 22 (5), pp.1745-1777. ⟨10.1214/11-AAP812⟩
hal-01056127v1  Journal articles
Nicolas BroutinLuc DevroyeGabor Lugosi. Almost optimal sparsification of random geometric graphs
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2016, 26, pp.3078-3109. ⟨10.1214/15-AAP1170⟩
hal-00773363v1  Journal articles
Nicolas BroutinRalph NeiningerHenning Sulzbach. A limit process for partial match queries in random quadtrees and 2-d trees
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2013, 23 (6), pp.2560-2603. ⟨10.1214/12-AAP912⟩
hal-01220794v1  Journal articles
Nicolas BroutinCécile Mailler. And/or trees: a local limit point of view
Random Structures and Algorithms, Wiley, In press
...
hal-01018174v1  Conference papers
Nicolas BroutinOlivier DevillersRoss Hemsley. Efficiently Navigating a Random Delaunay Triangulation
AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
...
hal-01018187v1  Poster communications
Nicolas BroutinOlivier DevillersRoss Hemsley. The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex
AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2014), Jun 2014, Paris, France
hal-00773365v1  Conference papers
Nicolas BroutinRalph NeiningerHenning Sulzbach. Partial match queries in random quadtrees
SoDA 2012 - Symposium on Discrete Algorithms, ACM; SIAM, Jan 2012, Kyoto, Japan. pp.1056-1065, ⟨10.1137/1.9781611973099.83⟩
hal-01056128v1  Journal articles
Nicolas BroutinLuc DevroyeGábor Lugosi. Connectivity of sparse Bluetooth networks
Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2015, 20 (48), pp.1-10
hal-01056124v1  Journal articles
Nicolas BroutinMinmin Wang. Reversing the cut tree of the Brownian continuum random tree
Electronic Journal of Probability, Institute of Mathematical Statistics (IMS), 2017, 22 (80), pp.1-23
...
hal-01194678v1  Conference papers
Nicolas BroutinPhilippe Flajolet. The height of random binary unlabelled trees
Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.121-134
hal-01056125v1  Journal articles
Nicolas BroutinMinmin Wang. Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees
Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2016
hal-01220797v1  Journal articles
Nicolas BroutinJean-François Marckert. Asymptotics of trees with a prescribed degree sequence
Random Structures and Algorithms, Wiley, 2014, 44, pp.290-316. ⟨10.1002/rsa.20463⟩
hal-00773366v1  Journal articles
Nicolas BroutinLuc DevroyeNicolas FraimanGábor Lugosi. Connectivity threshold for Bluetooth graphs
Random Structures and Algorithms, Wiley, 2014, 44, pp.45-66. ⟨10.1002/rsa.20459⟩
hal-00919175v1  Journal articles
Nicolas BroutinJean-François Marckert. Asymptotic of trees with a prescribed degree sequence and applications
Random Structures and Algorithms, Wiley, 2014, Random Structures and Algorithms, 44 (3), pp.290-316
...
hal-00940743v3  Journal articles
Nicolas BroutinOlivier DevillersRoss Hemsley. Efficiently navigating a random Delaunay triangulation
Random Structures and Algorithms, Wiley, 2016, 49 (1), pp.95--136. ⟨10.1002/rsa.20630⟩
hal-00773368v1  Journal articles
Nicolas BroutinOmar Fawzi. Longest path distance in random circuits
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2012, 21 (6), pp.856-881. ⟨10.1017/S0963548312000260⟩
hal-01056126v1  Journal articles
Nicolas BroutinRoss J. Kang. Bounded monochromatic components for random graphs
Journal of Combinatorics, International Press, In press
hal-00773362v1  Journal articles
Nicolas BroutinHenning Sulzbach. The dual tree of a recursive triangulation of the disk
Annals of Probability, Institute of Mathematical Statistics, 2015, 43, pp.738-781. ⟨10.1214/13-AOP894⟩
hal-00773360v1  Journal articles
Louigi Addario-BerryNicolas BroutinChristina GoldschmidtGrégory Miermont. The scaling limit of the minimum spanning tree of the complete graph
Annals of Probability, Institute of Mathematical Statistics, 2017, 45, pp.3075--3144
hal-00773370v1  Journal articles
Louigi Addario-BerryNicolas BroutinChristina Goldschmidt. The continuum limit of critical random graphs
Probability Theory and Related Fields, Springer Verlag, 2012, 152, pp.367-406. ⟨10.1007/s00440-010-0325-4⟩