2026-07-20T11:16:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20443 2024-07-18T12:12:42Z ddc:004 open_access

Galled Tree-Child Networks Chang, Yu-Sheng Fuchs, Michael Yu, Guan-Ru Phylogenetic Network galled Network tree-child Network asymptotic Enumeration Limit Law Lagrange Inversion We propose the class of galled tree-child networks which is obtained as intersection of the classes of galled networks and tree-child networks. For the latter two classes, (asymptotic) counting results and stochastic results have been proved with very different methods. We show that a counting result for the class of galled tree-child networks follows with similar tools as used for galled networks, however, the result has a similar pattern as the one for tree-child networks. In addition, we also consider the (suitably scaled) numbers of reticulation nodes of random galled tree-child networks and show that they are asymptotically normal distributed. This is in contrast to the limit laws of the corresponding quantities for galled networks and tree-child networks which have been both shown to be discrete. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yu-Sheng Chang and Michael Fuchs and Guan-Ru Yu 2024 Is Part Of LIPIcs, Volume 302, 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.AofA.2024.8 urn:nbn:de:0030-drops-204439 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2024.8 eng https://creativecommons.org/licenses/by/4.0/legalcode