AAAAAA

   
Results: 1-9 |
Results: 9
The dual tree of a recursive triangulation of the disk
Authors: Broutin, Nicolas Sulzbach, Henning
Citation: Broutin, Nicolas et Sulzbach, Henning, The dual tree of a recursive triangulation of the disk, Annals of probability , 43(2), 2015, pp. 738-781
Effective resistance of random trees
Authors: Addario-Berry, Louigi Broutin, Nicolas Lugosi, Gábor
Citation: Addario-berry, Louigi et al., Effective resistance of random trees, Annals of applied probability , 19(3), 2009, pp. 1092-1107
The total path length of split trees
Authors: Broutin, Nicolas Holmgren, Cecilia
Citation: Broutin, Nicolas et Holmgren, Cecilia, The total path length of split trees, Annals of applied probability , 22(5), 2012, pp. 1745-1777
Cutting down trees with a Markov chainsaw
Authors: Addario-Berry, Louigi Broutin, Nicolas Holmgren Cecilia
Citation: Addario-berry, Louigi et al., Cutting down trees with a Markov chainsaw, Annals of applied probability , 24(6), 2014, pp. 2297-2339
A limit process for partial match queries in random quadtrees and 2-d trees
Authors: Broutin, Nicolas Neininger, Ralph Sulzbach, Henning
Citation: Broutin, Nicolas et al., A limit process for partial match queries in random quadtrees and 2-d trees, Annals of applied probability , 23(6), 2013, pp. 2560-2603
On combinatorial testing problems
Authors: Addario-Berry, Louigi Broutin, Nicolas Devroye, Luc Lugosi, Gábor
Citation: Addario-berry, Louigi et al., On combinatorial testing problems, Annals of statistics , 38(5), 2010, pp. 3063-3092
The scaling limit of the minimum spanning tree of the complete graph
Authors: Addario-Berry, Louigi Broutin, Nicolas Goldschmidt, Christina Miermont, Grégory
Citation: Addario-berry, Louigi et al., The scaling limit of the minimum spanning tree of the complete graph, Annals of probability , 45(5), 2017, pp. 3075-3144
The scaling limit of the minimum spanning tree of the complete graph
Authors: Addario-Berry, Louigi Miermont, Grégory Goldschmidt, Christina Broutin, Nicolas
Citation: Addario-berry, Louigi et al., The scaling limit of the minimum spanning tree of the complete graph, Annals of probability (Online) , 45(5), 2017, pp. 3075-3144
Almost optimal sparsification of random geometric graphs
Authors: Broutin, Nicolas Devroye, Luc Lugosi, Gábor
Citation: Broutin, Nicolas et al., Almost optimal sparsification of random geometric graphs, Annals of applied probability , 26(5), 2016, pp. 3078-3109
Risultati: 1-9 |