Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/139047
題名: | On the asymptotic growth of the number of tree-child networks | 作者: | 符麥克 Fuchs, Michael Yu, Guan-Ru Zhang, Louxin |
貢獻者: | 應數系 | 日期: | 三月-2021 | 上傳時間: | 10-二月-2022 | 摘要: | In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with n leaves has the factor n^2n 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 n leaves grows like where a1=-2.338107410... is the largest root of the Airy function of the 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. | 關聯: | European J. Combin., Vol.93, pp.103278 | 資料類型: | article | DOI: | https://doi.org/10.1016/j.ejc.2020.103278 |
Appears in Collections: | 期刊論文 |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.