 |
 |
 |
|
|
||
|---|---|---|
| hal-00773360v1
Journal articles
The scaling limit of the minimum spanning tree of the complete graph Annals of Probability, Institute of Mathematical Statistics, 2017, 45 (5), pp.3075--3144. ⟨10.1214/16-AOP1132⟩  |
||
| hal-01056125v1
Journal articles
Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2016, ⟨10.3150/16-BEJ813⟩ |
||
| hal-00773363v1
Journal articles
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-00773370v1
Journal articles
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⟩ |
||
| hal-00769529v2
Reports
A cone can help you find your way in a Poisson Delaunay triangulation [Research Report] RR-8194, INRIA. 2012 |
||
| hal-00773362v1
Journal articles
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-00773366v1
Journal articles
Connectivity threshold for Bluetooth graphs Random Structures and Algorithms, Wiley, 2014, 44, pp.45-66. ⟨10.1002/rsa.20459⟩ |
||
| hal-01220794v1
Journal articles
And/or trees: a local limit point of view Random Structures and Algorithms, Wiley, In press |
||
| hal-01092563v1
Preprints, Working Papers, ...
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph 2014 |
||
| inria-00510232v1
Documents associated with scientific events
Les distances dans les arbres couvrants minimaux Journées MAS et Journée en l'honneur de Jacques Neveu, Aug 2010, Talence, France |
||
| hal-00773369v1
Journal articles
The distribution of height and diameter in random non-plane binary trees Random Structures and Algorithms, Wiley, 2011, 41 (2), pp.215-252. ⟨10.1002/rsa.20393⟩ |
||
| hal-01220798v1
Journal articles
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⟩ |
||
| hal-01056124v1
Journal articles
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-01018187v1
Poster communications
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-00773367v1
Journal articles
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-01056128v1
Journal articles
Connectivity of sparse Bluetooth networks Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2015, 20 (48), pp.1-10 |
||
| hal-01018174v1
Conference papers
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-00919175v1
Journal articles
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-01220797v1
Journal articles
Asymptotics of trees with a prescribed degree sequence Random Structures and Algorithms, Wiley, 2014, 44, pp.290-316. ⟨10.1002/rsa.20463⟩ |
||
| hal-00940743v3
Journal articles
Efficiently navigating a random Delaunay triangulation Random Structures and Algorithms, Wiley, 2016, 49 (1), pp.95--136. ⟨10.1002/rsa.20630⟩ |
||
| hal-01194678v1
Conference papers
The height of random binary unlabelled trees Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.121-134, ⟨10.46298/dmtcs.3559⟩ |
||
| hal-01384309v1
Preprints, Working Papers, ...
Self-similar real trees defined as fixed-points and their geometric properties 2016 |
||
| hal-00773364v1
Journal articles
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-00773365v1
Conference papers
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-00773368v1
Journal articles
Longest path distance in random circuits Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2012, 21 (6), pp.856-881. ⟨10.1017/S0963548312000260⟩ |
||
| hal-01056127v1
Journal articles
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-01092562v1
Journal articles
A new encoding of coalescent processes. Applications to the additive and multiplicative cases Probability Theory and Related Fields, Springer Verlag, 2016, 166 (1), pp.515--552. ⟨10.1007/s00440-015-0665-1⟩ |
||
| hal-01056126v1
Journal articles
Bounded monochromatic components for random graphs Journal of Combinatorics, International Press, In press, 9 (3), ⟨10.4310/JOC.2018.v9.n3.a1⟩ |
||
| tel-00842019v1
Habilitation à diriger des recherches
Random trees, graphs and recursive partitions Probability [math.PR]. Université Pierre et Marie Curie - Paris VI, 2013 |
||
|
|
||
