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 a 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) which was devised for the purpose of (exactly) counting galled networks. Moreover, an old result of Bender and Richmond (1984) plays a crucial role in our proofs, too.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.