Document Open Access Logo

Semi-Simplex Phylogenetic Networks: Tree-Child Networks and Galled Trees

Authors Michael Fuchs , Tsan-Cheng Yu

PDF

File

Thumbnail PDF
PDF
LIPIcs.AofA.2026.5.pdf
  • Filesize: 0.7 MB
  • 17 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Enumeration
  • Mathematics of computing → Distribution functions
Keywords
  • Semi-simplex networks
  • tree-child networks
  • galled trees
  • enumeration
  • limit laws
  • Sackin index

Metrics

Abstract

Understanding the size of phylogenetic network classes and the typical shape of a random network from a fixed class has been one of the major research focuses in phylogenetics over the last couple of years. In this extended abstract, we consider two subclasses of the (recently introduced) class of semi-simplex phylogenetic networks, namely, semi-simplex tree-child networks and semi-simplex galled trees. We clarify their sizes relative to the (known) sizes of general tree-child networks and galled trees, respectively, and prove limit laws for parameters of random networks from these classes. Additional classes of semi-simplex networks will be considered in the journal version of this paper.

Cite As Get BibTex

Michael Fuchs and Tsan-Cheng Yu. Semi-Simplex Phylogenetic Networks: Tree-Child Networks and Galled Trees. In 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 381, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.AofA.2026.5

Author Details

Michael Fuchs
  • Department of Mathematical Sciences, National Chengchi University, Taipei, 116, Taiwan
Tsan-Cheng Yu
  • Department of Mathematics, Fu Jen Catholic University, New Taipei City, 242062, Taiwan

Funding

  • Fuchs, Michael: NSTC-113-2115-M-004-004-MY3
  • Yu, Tsan-Cheng: NSCT-114-2115-M-030-006

Acknowledgements

We thank the reviewers for helpful comments.

References

  1. Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, and Noah A. Rosenberg. Asymptotic enumeration of rooted binary unlabeled galled trees with a fixed number of galls. In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, volume 302 of LIPIcs. Leibniz Int. Proc. Inform., pages 14, Art. No. 27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/lipics.aofa.2024.27.
  2. Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, Noah A. Rosenberg, and Karthnik V. Seetharaman. Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees. Submitted, 2026+. Google Scholar
  3. Michael G. B. Blum, Olivier François, and Svante Janson. The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance. Ann. Appl. Probab., 16(4):2195-2214, 2006. URL: https://doi.org/10.1214/105051606000000547.
  4. Mathilde Bouvel, Philippe Gambette, and Marefatollah Mansouri. Counting phylogenetic networks of level 1 and 2. J. Math. Biol., 81(6-7):1357-1395, 2020. URL: https://doi.org/10.1007/s00285-020-01543-5.
  5. Gabriel Cardona and Louxin Zhang. Counting and enumerating tree-child networks and their subclasses. J. Comput. System Sci., 114:84-104, 2020. URL: https://doi.org/10.1016/j.jcss.2020.06.001.
  6. Yu-Sheng Chang and Michael Fuchs. Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks. Bull. Math. Biol., 86(7):Paper No. 76, 23, 2024. URL: https://doi.org/10.1007/s11538-024-01309-w.
  7. Yu-Sheng Chang, Michael Fuchs, Hexuan Liu, Michael Wallner, and Guan-Ru Yu. Enumerative and distributional results for d-combining tree-child networks. Adv. in Appl. Math., 157:Paper No. 102704, 58, 2024. URL: https://doi.org/10.1016/j.aam.2024.102704.
  8. Michael Drmota. Random Trees. SpringerWienNewYork, Vienna, 2009. An interplay between combinatorics and probability. URL: https://doi.org/10.1007/978-3-211-75357-6.
  9. Mareike Fischer, Lena Herbst, Sophie J. Kersting, Annemarie Luise Kühn, and Kristina Wicke. Tree Balance Indices: A Comprehensive Survey. Springer International Publishing, Cham, Switzerland, 2023. URL: https://doi.org/10.1007/978-3-031-39800-1.
  10. Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. Cambridge University Press, Cambridge, 2009. URL: https://doi.org/10.1017/CBO9780511801655.
  11. Andrew Francis. "Normal" phylognenetic networks emerge as the leading class. ArXiv:2107.10414, 2021. Google Scholar
  12. Michael Fuchs and Bernhard Gittenberger. Sackin indices for labeled and unlabeled classes of galled trees. J. Math. Biol., 90(4):Paper No. 42, 34, 2025. URL: https://doi.org/10.1007/s00285-025-02205-0.
  13. Michael Fuchs, En-Yu Huang, and Guan-Ru Yu. Counting phylogenetic networks with few reticulation vertices: a second approach. Discrete Appl. Math., 320:140-149, 2022. URL: https://doi.org/10.1016/j.dam.2022.03.026.
  14. Michael Fuchs and Mike Steel. A dichotomy law for certain classes of phylogenetic networks. Bull. Math. Biol., 87(11):Paper No. 153, 17, 2025. URL: https://doi.org/10.1007/s11538-025-01536-9.
  15. Michael Fuchs, Guan-Ru Yu, and Louxin Zhang. On the asymptotic growth of the number of tree-child networks. European J. Combin., 93:Paper No. 103278, 20, 2021. URL: https://doi.org/10.1016/j.ejc.2020.103278.
  16. Michael Fuchs, Guan-Ru Yu, and Louxin Zhang. Asymptotic enumeration and distributional properties of galled networks. J. Combin. Theory Ser. A, 189:Paper No. 105599, 28, 2022. URL: https://doi.org/10.1016/j.jcta.2022.105599.
  17. Andreas D. M. Gunawan, Jeyaram Rathin, and Louxin Zhang. Counting and enumerating galled networks. Discrete Appl. Math., 283:644-654, 2020. URL: https://doi.org/10.1016/j.dam.2020.03.005.
  18. Sungsik Kong, Joan Carles Pons, Laura Kubatko, and Kristina Wicke. Classes of explicit phylogenetic networks and their biological and mathematical significance. J. Math. Biol., 84(6):Paper No. 47, 44, 2022. URL: https://doi.org/10.1007/s00285-022-01746-y.
  19. Hosam M. Mahmoud. Evolution of random search trees. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New York, 1992. A Wiley-Interscience Publication. Google Scholar
  20. Colin McDiarmid, Charles Semple, and Dominic Welsh. Counting phylogenetic networks. Ann. Comb., 19(1):205-224, 2015. URL: https://doi.org/10.1007/s00026-015-0260-2.
  21. Charles Semple and Mike Steel. Phylogenetics, volume 24 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, 2003. Google Scholar
  22. Mike Steel. Phylogeny - Discrete and Random Processes in Evolution, volume 89 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2016. URL: https://doi.org/10.1137/1.9781611974485.ch1.
  23. Benedikt Stufler. A branching process approach to level-k phylogenetic networks. Random Structures Algorithms, 61(2):397-421, 2022. URL: https://doi.org/10.1002/rsa.21065.
  24. Stephen J. Willson. Unique determination of some homoplasies at hybridization events. Bull. Math. Biol., 69(5):1709-1725, 2007. URL: https://doi.org/10.1007/s11538-006-9187-4.
  25. Louxin Zhang. The Sackin index of simplex networks. In Comparative genomics, volume 13234 of Lecture Notes in Comput. Sci., pages 52-67. Springer, Cham, 2022. URL: https://doi.org/10.1007/978-3-031-06220-9_4.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact