Broutin, Nicolas; Devroye, Luc; Fraiman, Nicolas Recursive functions on conditional Galton-Watson trees. (English) Zbl 07279069 Random Struct. Algorithms 57, No. 2, 304-316 (2020). MSC: 68 05 PDF BibTeX XML Cite \textit{N. Broutin} et al., Random Struct. Algorithms 57, No. 2, 304--316 (2020; Zbl 07279069) Full Text: DOI
Broutin, Nicolas; Mailler, Cécile And/or trees: a local limit point of view. (English) Zbl 1401.05065 Random Struct. Algorithms 53, No. 1, 15-58 (2018). MSC: 05C05 05C80 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{C. Mailler}, Random Struct. Algorithms 53, No. 1, 15--58 (2018; Zbl 1401.05065) Full Text: DOI
Broutin, Nicolas; Kang, Ross J. Bounded monochromatic components for random graphs. (English) Zbl 1387.05190 J. Comb. 9, No. 3, 411-446 (2018). MSC: 05C70 05C15 05C80 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{R. J. Kang}, J. Comb. 9, No. 3, 411--446 (2018; Zbl 1387.05190) Full Text: DOI arXiv
Addario-Berry, Louigi; Broutin, Nicolas; Goldschmidt, Christina; Miermont, Grégory The scaling limit of the minimum spanning tree of the complete graph. (English) Zbl 1407.60013 Ann. Probab. 45, No. 5, 3075-3144 (2017). MSC: 60C05 60F05 05C80 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Ann. Probab. 45, No. 5, 3075--3144 (2017; Zbl 1407.60013) Full Text: DOI Euclid arXiv
Broutin, Nicolas; Wang, Minmin Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees. (English) Zbl 1388.60036 Bernoulli 23, No. 4A, 2380-2433 (2017). Reviewer: David B. Penman (Colchester) MSC: 60C05 05C80 60F17 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{M. Wang}, Bernoulli 23, No. 4A, 2380--2433 (2017; Zbl 1388.60036) Full Text: DOI Euclid arXiv
Broutin, Nicolas; Devroye, Luc; Lugosi, Gábor Almost optimal sparsification of random geometric graphs. (English) Zbl 1375.60031 Ann. Appl. Probab. 26, No. 5, 3078-3109 (2016). MSC: 60C05 05C80 PDF BibTeX XML Cite \textit{N. Broutin} et al., Ann. Appl. Probab. 26, No. 5, 3078--3109 (2016; Zbl 1375.60031) Full Text: DOI arXiv
Broutin, Nicolas; Devillers, Olivier; Hemsley, Ross Efficiently navigating a random Delaunay triangulation. (English) Zbl 1344.05050 Random Struct. Algorithms 49, No. 1, 95-136 (2016). MSC: 05C10 05C85 68P05 68R10 05C82 PDF BibTeX XML Cite \textit{N. Broutin} et al., Random Struct. Algorithms 49, No. 1, 95--136 (2016; Zbl 1344.05050) Full Text: DOI
Broutin, Nicolas; Devroye, Luc; Lugosi, Gabor Connectivity of sparse Bluetooth networks. (English) Zbl 1319.05114 Electron. Commun. Probab. 20, Paper No. 48, 10 p. (2015). MSC: 05C80 05C40 68R10 68M10 60C05 PDF BibTeX XML Cite \textit{N. Broutin} et al., Electron. Commun. Probab. 20, Paper No. 48, 10 p. (2015; Zbl 1319.05114) Full Text: DOI arXiv
Broutin, Nicolas; Sulzbach, Henning The dual tree of a recursive triangulation of the disk. (English) Zbl 1355.60014 Ann. Probab. 43, No. 2, 738-781 (2015). Reviewer: Ping Sun (Shenyang) MSC: 60C05 60F17 05C05 11Y16 05A15 05A16 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{H. Sulzbach}, Ann. Probab. 43, No. 2, 738--781 (2015; Zbl 1355.60014) Full Text: DOI Euclid arXiv
Addario-Berry, Louigi; Broutin, Nicolas; Holmgren, Cecilia Cutting down trees with a Markov chainsaw. (English) Zbl 1352.60009 Ann. Appl. Probab. 24, No. 6, 2297-2339 (2014). Reviewer: Demetres Christofides (Pyla) MSC: 60C05 05C05 60F17 60J80 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Ann. Appl. Probab. 24, No. 6, 2297--2339 (2014; Zbl 1352.60009) Full Text: DOI Euclid arXiv
Broutin, Nicolas; Marckert, Jean-François Asymptotics of trees with a prescribed degree sequence and applications. (English) Zbl 1290.05059 Random Struct. Algorithms 44, No. 3, 290-316 (2014). MSC: 05C05 05C07 05C80 05C10 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{J.-F. Marckert}, Random Struct. Algorithms 44, No. 3, 290--316 (2014; Zbl 1290.05059) Full Text: DOI arXiv
Broutin, Nicolas; Devroye, Luc; Fraiman, Nicolas; Lugosi, Gábor Connectivity threshold of Bluetooth graphs. (English) Zbl 1280.05069 Random Struct. Algorithms 44, No. 1, 45-66 (2014). MSC: 05C40 05C80 05C10 68M10 68R10 PDF BibTeX XML Cite \textit{N. Broutin} et al., Random Struct. Algorithms 44, No. 1, 45--66 (2014; Zbl 1280.05069) Full Text: DOI arXiv
Broutin, Nicolas (ed.); Devroye, Luc (ed.) Proceeding of the 23rd international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’12), Montreal, Canada, June 18–22, 2012. (English) Zbl 1257.00015 Discrete Mathematics and Theoretical Computer Science. Proceedings. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). 490 p., electronic only, open access (2012). MSC: 00B25 05-06 05C85 05-04 PDF BibTeX XML Cite \textit{N. Broutin} (ed.) and \textit{L. Devroye} (ed.), Proceeding of the 23rd international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA'12), Montreal, Canada, June 18--22, 2012. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS) (2012; Zbl 1257.00015) Full Text: Link
Broutin, Nicolas; Holmgren, Cecilia The total path length of split trees. (English) Zbl 1254.05037 Ann. Appl. Probab. 22, No. 5, 1745-1777 (2012). MSC: 05C05 05C38 05C80 68R10 60C05 68P05 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{C. Holmgren}, Ann. Appl. Probab. 22, No. 5, 1745--1777 (2012; Zbl 1254.05037) Full Text: DOI Euclid arXiv
Broutin, Nicolas; Fawzi, Omar Longest path distance in random circuits. (English) Zbl 1252.05049 Comb. Probab. Comput. 21, No. 6, 856-881 (2012). MSC: 05C12 05C38 05C80 94C05 60C05 05C05 94D99 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{O. Fawzi}, Comb. Probab. Comput. 21, No. 6, 856--881 (2012; Zbl 1252.05049) Full Text: DOI arXiv
Broutin, Nicolas; Flajolet, Philippe The distribution of height and diameter in random non-plane binary trees. (English) Zbl 1250.05095 Random Struct. Algorithms 41, No. 2, 215-252 (2012). MSC: 05C80 05C05 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{P. Flajolet}, Random Struct. Algorithms 41, No. 2, 215--252 (2012; Zbl 1250.05095) Full Text: DOI arXiv
Addario-Berry, L.; Broutin, N.; Goldschmidt, C. The continuum limit of critical random graphs. (English) Zbl 1239.05165 Probab. Theory Relat. Fields 152, No. 3-4, 367-406 (2012). MSC: 05C80 05C81 05C12 05C35 60C05 05C05 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Probab. Theory Relat. Fields 152, No. 3--4, 367--406 (2012; Zbl 1239.05165) Full Text: DOI
Addario-Berry, Louigi; Broutin, Nicolas; Goldschmidt, Christina Critical random graphs: limiting constructions and distributional properties. (English) Zbl 1227.05224 Electron. J. Probab. 15, Paper No. 25, 741-775 (2010). MSC: 05C80 60C05 60F99 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Electron. J. Probab. 15, Paper No. 25, 741--775 (2010; Zbl 1227.05224) Full Text: DOI EMIS arXiv
Addario-Berry, Louigi; Broutin, Nicolas; Devroye, Luc; Lugosi, Gábor On combinatorial testing problems. (English) Zbl 1200.62059 Ann. Stat. 38, No. 5, 3063-3092 (2010). MSC: 62H15 05C90 62M99 62F03 62F05 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Ann. Stat. 38, No. 5, 3063--3092 (2010; Zbl 1200.62059) Full Text: DOI arXiv
Addario-Berry, Louigi; Broutin, Nicolas; Lugosi, Gábor The longest minimum-weight path in a complete graph. (English) Zbl 1209.05219 Comb. Probab. Comput. 19, No. 1, 1-19 (2010). MSC: 05C80 05C38 05C22 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Comb. Probab. Comput. 19, No. 1, 1--19 (2010; Zbl 1209.05219) Full Text: DOI arXiv
Broutin, Nicolas; Devroye, Luc; McLeish, Erin Note on the structure of Kruskal’s algorithm. (English) Zbl 1219.05181 Algorithmica 56, No. 2, 141-159 (2010). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C80 68R10 PDF BibTeX XML Cite \textit{N. Broutin} et al., Algorithmica 56, No. 2, 141--159 (2010; Zbl 1219.05181) Full Text: DOI
Addario-Berry, L.; Broutin, N.; Reed, B. Critical random graphs and the structure of a minimum spanning tree. (English) Zbl 1214.05154 Random Struct. Algorithms 35, No. 3, 323-347 (2009). MSC: 05C80 05C35 05C05 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Random Struct. Algorithms 35, No. 3, 323--347 (2009; Zbl 1214.05154) Full Text: DOI
Broutin, N.; Devroye, L.; McLeish, E. Weighted height of random trees. (English) Zbl 1147.68058 Acta Inf. 45, No. 4, 237-277 (2008). MSC: 68R10 05C05 05C80 68P05 PDF BibTeX XML Cite \textit{N. Broutin} et al., Acta Inf. 45, No. 4, 237--277 (2008; Zbl 1147.68058) Full Text: DOI
Broutin, N.; Devroye, L.; McLeish, E.; de la Salle, M. The height of increasing trees. (English) Zbl 1148.05024 Random Struct. Algorithms 32, No. 4, 494-518 (2008). MSC: 05C05 05C80 PDF BibTeX XML Cite \textit{N. Broutin} et al., Random Struct. Algorithms 32, No. 4, 494--518 (2008; Zbl 1148.05024) Full Text: DOI
Addario-Berry, Louigi; Broutin, Nicolas; Reed, Bruce The diameter of the minimum spanning tree of a complete graph. (English) Zbl 1190.05042 Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18–22, 2006. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 237-248, electronic only (2006). MSC: 05C05 05C35 05C80 05C85 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., in: Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18--22, 2006. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 237--248 (2006; Zbl 1190.05042) Full Text: Link