Addario-Berry, Louigi; Donderwinkel, Serte Random trees have height \(O(\sqrt{n})\). (English) Zbl 07940224 Ann. Probab. 52, No. 6, 2238-2280 (2024). MSC: 60C05 05C05 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Heuberger, Clemens; Selkirk, Sarah J.; Wagner, Stephan The distribution of the maximum protection number in simply generated trees. (English) Zbl 07938737 Comb. Probab. Comput. 33, No. 4, 518-553 (2024). MSC: 05C05 05A15 05A16 05C80 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fill, James Allen; Janson, Svante; Wagner, Stephan Conditioned Galton-Watson trees: the shape functional, and more on the sum of powers of subtree sizes and its mean. (English) Zbl 1545.05038 Matematica 3, No. 2, 435-508 (2024). Reviewer: Mei Yin (Denver) MSC: 05C05 60F05 60C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Gittenberger, Bernhard; Gołębiewski, Zbigniew; Larcher, Isabella; Sulkowska, Małgorzata Protection numbers in simply generated trees and Pólya trees. (English) Zbl 1524.05034 Appl. Anal. Discrete Math. 17, No. 1, 1-24 (2023). MSC: 05C05 05C30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fill, James Allen; Janson, Svante Corrigendum to: “The sum of powers of subtree sizes for conditioned Galton-Watson trees”. (English) Zbl 1515.05046 Electron. J. Probab. 28, Paper No. 23, 2 p. (2023). MSC: 05C05 30E99 60F05 60C05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Benkner, Louisa Seelbach; Wagner, Stephan Distinct fringe subtrees in random trees. (English) Zbl 07628950 Algorithmica 84, No. 12, 3686-3728 (2022). MSC: 05C05 05C80 60C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fill, James Allen; Janson, Svante The sum of powers of subtree sizes for conditioned Galton-Watson trees. (English) Zbl 1498.05057 Electron. J. Probab. 27, Paper No. 114, 77 p. (2022); corrigendum ibid. 28, Paper No. 23, 2 p. (2023). MSC: 05C05 30E99 60C05 60F05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Addario-Berry, Louigi; Brandenberger, Anna; Hamdan, Jad; Kerriou, Céline Universal height and width bounds for random trees. (English) Zbl 1507.60017 Electron. J. Probab. 27, Paper No. 118, 24 p. (2022). MSC: 60C05 05C05 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Stufler, Benedikt Local limits of large Galton-Watson trees rerooted at a random vertex. (English. French summary) Zbl 1467.60066 Ann. Inst. Henri Poincaré, Probab. Stat. 55, No. 1, 155-183 (2019). MSC: 60J80 60B10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid Link
Gittenberger, Bernhard; Jin, Emma Yu; Wallner, Michael On the shape of random Pólya structures. (English) Zbl 1380.05180 Discrete Math. 341, No. 4, 896-911 (2018). MSC: 05C80 05C05 05C25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Durant, Kevin; Wagner, Stephan On the distribution of betweenness centrality in random trees. (English) Zbl 1380.05178 Theor. Comput. Sci. 699, 33-52 (2017). MSC: 05C80 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Kortchemski, Igor; Marzouk, Cyril Simply generated non-crossing partitions. (English) Zbl 1371.05230 Comb. Probab. Comput. 26, No. 4, 560-592 (2017). MSC: 05C70 05C80 60C05 05C05 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kortchemski, Igor; Marzouk, Cyril Triangulating stable laminations. (English) Zbl 1338.05249 Electron. J. Probab. 21, Paper No. 11, 31 p. (2016). MSC: 05C80 60C05 05C05 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid
Bassino, Frédérique; Sportiello, Andrea Linear-time generation of inhomogeneous random directed walks. (English) Zbl 1429.60014 Sedgewick, Robert (ed.) et al., Proceedings of the 12th workshop on analytic algorithmics and combinatorics (ANALCO ’15), San Diego, CA, USA, January 4, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 51-65 (2015). MSC: 60C05 05C81 60G50 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Janson, Svante; Stefánsson, Sigurdur Örn Scaling limits of random planar maps with a unique large face. (English) Zbl 1320.05112 Ann. Probab. 43, No. 3, 1045-1081 (2015). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C05 60F17 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid
Björnberg, Jakob Erik; Stefánsson, Sigurdur Örn Recurrence of bipartite planar maps. (English) Zbl 1286.05153 Electron. J. Probab. 19, Paper No. 31, 40 p. (2014). MSC: 05C80 05C81 05C05 60J80 60F05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kuba, Markus; Panholzer, Alois A unifying approach for proving hook-length formulas for weighted tree families. (English) Zbl 1287.05009 Graphs Comb. 29, No. 6, 1839-1865 (2013). Reviewer: László A. Székely (Columbia) MSC: 05A15 05C05 05C22 × Cite Format Result Cite Review PDF Full Text: DOI
Addario-Berry, Louigi; Devroye, Luc; Janson, Svante Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees. (English) Zbl 1278.60128 Ann. Probab. 41, No. 2, 1072-1087 (2013). Reviewer: Aleksander Iksanov (Kiev) MSC: 60J80 60C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid
Janson, Svante Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (extended abstract). (English) Zbl 1296.60234 Broutin, Nicolas (ed.) et al., 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). Discrete Mathematics and Theoretical Computer Science. Proceedings, 479-490, electronic only (2012). MSC: 60J80 05C05 05C80 60C05 60F05 × Cite Format Result Cite Review PDF Full Text: Link
Gittenberger, Bernhard; Kraus, Veronika On the number of transversals in random trees. (English) Zbl 1296.05175 Broutin, Nicolas (ed.) et al., 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). Discrete Mathematics and Theoretical Computer Science. Proceedings, 141-154, electronic only (2012). MSC: 05C80 05C05 05C30 × Cite Format Result Cite Review PDF Full Text: Link
Panholzer, Alois; Seitz, Georg Limiting distributions for the number of inversions in labelled tree families. (English) Zbl 1256.05050 Ann. Comb. 16, No. 4, 847-870 (2012). MSC: 05C05 05C75 60F05 05A16 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Stefánsson, Sigurdur Ö.; Zohren, Stefan Spectral dimension of trees with a unique infinite spine. (English) Zbl 1246.82045 J. Stat. Phys. 147, No. 5, 942-962 (2012). MSC: 82B41 60J80 05C05 28A78 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Janson, Svante Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation. (English) Zbl 1244.60013 Probab. Surv. 9, 103-252 (2012). MSC: 60C05 05C05 60F05 60J80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid
Fill, James Allen; Janson, Svante Precise logarithmic asymptotics for the right tails of some limit random variables for random trees. (English) Zbl 1232.60021 Ann. Comb. 12, No. 4, 403-416 (2009). MSC: 60F10 60C05 60J65 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Drmota, Michael; Gittenberger, Bernhard; Panholzer, Alois; Prodinger, Helmut; Ward, Mark Daniel On the shape of the fringe of various types of random trees. (English) Zbl 1181.68334 Math. Methods Appl. Sci. 32, No. 10, 1207-1245 (2009). MSC: 68W40 05C05 05C80 68P05 × Cite Format Result Cite Review PDF Full Text: DOI
Richard, Christoph On \(q\)-functional equations and excursion moments. (English) Zbl 1227.39006 Discrete Math. 309, No. 1, 207-230 (2009). MSC: 39A13 05A15 05A30 33D15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kuba, Markus; Panholzer, Alois Isolating a leaf in rooted trees via random cuttings. (English) Zbl 1154.05019 Ann. Comb. 12, No. 1, 81-99 (2008). MSC: 05C05 05A16 60F05 × Cite Format Result Cite Review PDF Full Text: DOI
Wagner, Stephan G. On the number of decomposable trees. (English) Zbl 1190.05050 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, 301-308, electronic only (2006). MSC: 05C05 05C30 05C70 05A15 05A16 × Cite Format Result Cite Review PDF Full Text: Link
Panholzer, Alois Cutting down very simple trees. (English) Zbl 1120.05020 Quaest. Math. 29, No. 2, 211-227 (2006). Reviewer: J. W. Moon (Edmonton) MSC: 05C05 60F05 × Cite Format Result Cite Review PDF Full Text: DOI
Gittenberger, Bernhard; Panholzer, Alois Some results for monotonically labelled simply generated trees. (English) Zbl 1104.68084 Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 173-180, electronic (2005). MSC: 68R10 05C05 05C78 × Cite Format Result Cite Review PDF
Mazza, Christian Simply generated trees, B-series and Wigner processes. (English) Zbl 1077.68075 Random Struct. Algorithms 25, No. 3, 293-310 (2004). MSC: 68R10 05C05 05A15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kemp, Rainer On the representation of simply generated trees by leftist trees. (English) Zbl 1016.05024 Eur. J. Comb. 24, No. 5, 581-605 (2003). MSC: 05C05 05C62 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Meir, A.; Moon, J. W. On centroid branches of trees from certain families. (English) Zbl 1031.05036 Discrete Math. 250, No. 1-3, 153-170 (2002). Reviewer: László A.Székely (Columbia) MSC: 05C05 05C12 × Cite Format Result Cite Review PDF Full Text: DOI
Kemp, Rainer On the expected number of leftist nodes in simply generated trees. (English) Zbl 0993.68070 J. Autom. Lang. Comb. 6, No. 3, 313-343 (2001). MSC: 68R05 × Cite Format Result Cite Review PDF
Gittenberger, Bernhard The number of descendants in simply generated random trees. (English) Zbl 0965.68070 Gardy, Danièle (ed.) et al., Mathematics and computer science. Algorithms, trees, combinatorics and probabilities. Proceedings of the colloquium, September 18-20, 2000. Basel: Birkhäuser. 65-73 (2000). MSC: 68R10 × Cite Format Result Cite Review PDF
Sageev, Michah Ends of group pairs and non-positively curved cube complexes. (English) Zbl 0861.20041 Proc. Lond. Math. Soc., III. Ser. 71, No. 3, 585-617 (1995). Reviewer: D.McCullough (Norman) MSC: 20F65 20E08 57M07 57M60 20E06 × Cite Format Result Cite Review PDF Full Text: DOI Backlinks: MO
Gutjahr, Walter Expectation transfer between branching processes and random trees. (English) Zbl 0792.05129 Random Struct. Algorithms 4, No. 4, 447-467 (1993). Reviewer: J.W.Moon (Edmonton) MSC: 05C80 05C05 60J80 × Cite Format Result Cite Review PDF Full Text: DOI
Gutjahr, W. J. Uniform random generation of expressions respecting algebraic identities. (English) Zbl 0752.65002 Computing 47, No. 1, 51-67 (1991). Reviewer: W.Grecksch (Merseburg) MSC: 65C10 68W15 68Q45 68R10 05C30 × Cite Format Result Cite Review PDF Full Text: DOI
Prodinger, Helmut On the altitude of specified nodes in random trees. (English) Zbl 0548.05053 J. Graph Theory 8, 481-485 (1984). Reviewer: J.W.Moon MSC: 05C80 05C05 60C05 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Zhenyu Additive enumeration problems over trees. (English) Zbl 0527.05027 Acta Math. Sci. 3, 445-453 (1983). MSC: 05C05 05C30 × Cite Format Result Cite Review PDF