On the Asymptotic Growth of the Number of Tree-Child Networks
Michael Fuchs, Guan-Ru Yu, Louxin Zhang

TL;DR
This paper precisely characterizes the asymptotic growth of the number of tree-child networks with n leaves, refining previous estimates by identifying the main growth term and its constant factors.
Contribution
It provides a complete asymptotic formula for counting tree-child networks, using a bijective approach and advanced asymptotic methods to improve prior results.
Findings
Number of tree-child networks grows like \[ \Theta\left(n^{-2/3}e^{a_1(3n)^{1/3}}\left(\frac{12}{e^2}\right)^{n}n^{2n}\right)\]
Identifies the constant factors and the dominant exponential growth term.
Uses a bijective mapping to translate the problem into a word-based combinatorial problem.
Abstract
In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with leaves has the factor in its main asymptotic growth term. In this paper, we improve this by completely identifying the main asymptotic growth term up to a constant. More precisely, we show that the number of tree-child networks with leaves grows like \[ \Theta\left(n^{-2/3}e^{a_1(3n)^{1/3}}\left(\frac{12}{e^2}\right)^{n}n^{2n}\right), \] where is the largest root of the Airy function of first kind. For the proof, we bijectively map the underlying graph-theoretical problem onto a problem on words. For the latter, we can find a recurrence to which a recent powerful asymptotic method of Elvey Price, Fang, and Wallner (2019) can be applied.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Advanced Combinatorial Mathematics · Graph theory and applications
