| dc.contributor | 應數系 | |
| dc.creator (作者) | 符麥克 | |
| dc.creator (作者) | Fuchs, Michael;Liu, Hexuan;Yu, Tsan-Cheng | |
| dc.date (日期) | 2024-01 | |
| dc.date.accessioned | 24-May-2024 11:34:18 (UTC+8) | - |
| dc.date.available | 24-May-2024 11:34:18 (UTC+8) | - |
| dc.date.issued (上傳時間) | 24-May-2024 11:34:18 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/151270 | - |
| dc.description.abstract (摘要) | We prove limit laws for the number of occurrences of a pattern on the fringe of a ranked tree-child network which is picked uniformly at random. Our results extend the limit law for cherries proved by Bienvenu et al. (Random Struct. Algoritm. 60 (2022), no. 4, 653–689). For patterns of height 1 and 2, we show that they either occur frequently (mean is asymptotically linear and limit law is normal) or sporadically (mean is asymptotically constant and limit law is Poisson) or not all (mean tends to 0 and limit law is degenerate). We expect that these are the only possible limit laws for any fringe pattern. | |
| dc.format.extent | 97 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Random Structures & Algorithms, Vol.64, No.1, pp.15-37 | |
| dc.subject (關鍵詞) | limit law; method of moments; pattern; Phylogenetic net-work; ranked tree-child network; tree-child network | |
| dc.title (題名) | Limit theorems for patterns in ranked tree-child networks | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1002/rsa.21177 | |
| dc.doi.uri (DOI) | https://doi.org/10.1002/rsa.21177 | |
