Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.jcta.2022.105599
Title: Asymptotic enumeration and distributional properties of galled networks
Authors: Fuchs, M
Yu, GR
Zhang, L 
Issue Date: 1-Jul-2022
Publisher: Elsevier BV
Citation: Fuchs, M, Yu, GR, Zhang, L (2022-07-01). Asymptotic enumeration and distributional properties of galled networks. Journal of Combinatorial Theory. Series A 189 : 105599-105599. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jcta.2022.105599
Abstract: We show a first-order asymptotics result for the number of galled networks with n leaves. This is the first class of phylogenetic networks of large size for which an asymptotic counting result of such strength can be obtained. In addition, we also find the limiting distribution of the number of reticulation nodes of galled networks with n leaves chosen uniformly at random. These results are obtained by performing an asymptotic analysis of a recent approach of Gunawan, Rathin, and Zhang (2020) [12] which was devised for the purpose of (exactly) counting galled networks. Moreover, an old result of Bender and Richmond (1984) [1] plays a crucial role in our proofs, too.
Source Title: Journal of Combinatorial Theory. Series A
URI: https://scholarbank.nus.edu.sg/handle/10635/228979
ISSN: 00973165
10960899
DOI: 10.1016/j.jcta.2022.105599
Appears in Collections:Elements
Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
1-s2.0-S0097316522000073-main_JTB.pdfPublished version402.3 kBAdobe PDF

CLOSED

None

SCOPUSTM   
Citations

2
checked on Sep 23, 2022

Page view(s)

27
checked on Sep 22, 2022

Download(s)

1
checked on Sep 22, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.