Enumeration of d-combining Tree-Child Networks

DOI10.4230/LIPICS.AOFA.2022.5MaRDI QIDQ6393710zbMATH OpenFDO

Authors Yu-Sheng Chang, Michael Fuchs, Hexuan Liu, Michael Wallner, G.-R. Yu

Publication date 14 March 2022

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2022.5

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Abstract: 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 {it 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 {it $d$-combining tree-child networks} where every reticulation node has now $dgeq2$ 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.

Cited in

(2)

• Progressive and rushed Dyck paths
• Lifted inference beyond first-order logic

This page was built for publication: Enumeration of $d$-combining Tree-Child Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393710)