| dc.contributor | 應數系 | - |
| dc.creator (作者) | 符麥克 | - |
| dc.creator (作者) | Fuchs, Michael | - |
| dc.creator (作者) | Yu, Guan-Ru | - |
| dc.creator (作者) | Zhang, Louxin | - |
| dc.date (日期) | 2021-03 | - |
| dc.date.accessioned | 10-Feb-2022 14:59:42 (UTC+8) | - |
| dc.date.available | 10-Feb-2022 14:59:42 (UTC+8) | - |
| dc.date.issued (上傳時間) | 10-Feb-2022 14:59:42 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/139047 | - |
| dc.description.abstract (摘要) | 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. | - |
| dc.format.extent | 548775 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | European Journal of Combinatorics, Vol.93, 103278 | - |
| dc.title (題名) | On the asymptotic growth of the number of tree-child networks | - |
| dc.type (資料類型) | article | - |
| dc.identifier.doi (DOI) | 10.1016/j.ejc.2020.103278 | - |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.ejc.2020.103278 | - |
