Chang, Y.-S., Fuchs, M., Liu, H., Wallner, M., & Yu, G.-R. (2022). Enumeration of d-Combining Tree-Child Networks. In 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022). 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022), Philadelphia, United States of America (the). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.AofA.2022.5
Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for bicombining tree-child networks which are tree-child networks with every reticulation node having exactly two parents. In this paper, we extend these studies to d-combining tree-child networks where every reticulation node has now d ≥ 2 parents. Moreover, we also give results and conjectures on the distributional behavior of the number of reticulation nodes of a network which is drawn uniformly at random from the set of all tree-child networks with the same number of leaves.
en
Project title:
Gestreckte Exponenten und darüber hinaus: P 34142-N (Fonds zur Förderung der wissenschaftlichen Forschung (FWF))
-
Project (external):
Ministry of Science and Technology Ministry of Science and Technology
CC BY 4.0
