随机平面递增树:根据离叶子的距离对顶点进行渐近枚举

IF 0.9 3区 数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
M. Bóna, B. Pittel
{"title":"随机平面递增树:根据离叶子的距离对顶点进行渐近枚举","authors":"M. Bóna, B. Pittel","doi":"10.1002/rsa.21138","DOIUrl":null,"url":null,"abstract":"We prove that for any fixed k$$ k $$ , the probability that a random vertex of a random increasing plane tree is of rank k$$ k $$ , that is, the probability that a random vertex is at distance k$$ k $$ from the leaves, converges to a constant ck$$ {c}_k $$ as the size n$$ n $$ of the tree goes to infinity. We prove that 1−∑j≤kck<22k+3(2k+4)!$$ 1-{\\sum}_{j\\le k}{c}_k<\\frac{2^{2k+3}}{\\left(2k+4\\right)!} $$ , so that the tail of the limiting rank distribution is super‐exponentially narrow. We prove that the latter property holds uniformly for all finite n$$ n $$ as well. More generally, we prove that the ranks of a finite uniformly random set of vertices are asymptotically independent, each with distribution {ck}$$ \\left\\{{c}_k\\right\\} $$ . We compute the exact value of ck$$ {c}_k $$ for 0≤k≤3$$ 0\\le k\\le 3 $$ , demonstrating that the limiting expected fraction of vertices with rank ≤3$$ \\le 3 $$ is 0.9997$$ 0.9997 $$ … We show that with probability 1−n−0.99ε$$ 1-{n}^{-0.99\\varepsilon } $$ the highest rank of a vertex in the tree is sandwiched between (1−ε)logn/loglogn$$ \\left(1-\\varepsilon \\right)\\log n/\\mathrm{loglog}n $$ and (1.5+ε)logn/loglogn$$ \\left(1.5+\\varepsilon \\right)\\log n/\\mathrm{loglog}n $$ , and that this rank is asymptotic to logn/loglogn$$ \\log n/\\mathrm{loglog}n $$ with probability 1−o(1)$$ 1-o(1) $$ .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"2013 1","pages":"102 - 129"},"PeriodicalIF":0.9000,"publicationDate":"2022-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves\",\"authors\":\"M. Bóna, B. Pittel\",\"doi\":\"10.1002/rsa.21138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that for any fixed k$$ k $$ , the probability that a random vertex of a random increasing plane tree is of rank k$$ k $$ , that is, the probability that a random vertex is at distance k$$ k $$ from the leaves, converges to a constant ck$$ {c}_k $$ as the size n$$ n $$ of the tree goes to infinity. We prove that 1−∑j≤kck<22k+3(2k+4)!$$ 1-{\\\\sum}_{j\\\\le k}{c}_k<\\\\frac{2^{2k+3}}{\\\\left(2k+4\\\\right)!} $$ , so that the tail of the limiting rank distribution is super‐exponentially narrow. We prove that the latter property holds uniformly for all finite n$$ n $$ as well. More generally, we prove that the ranks of a finite uniformly random set of vertices are asymptotically independent, each with distribution {ck}$$ \\\\left\\\\{{c}_k\\\\right\\\\} $$ . We compute the exact value of ck$$ {c}_k $$ for 0≤k≤3$$ 0\\\\le k\\\\le 3 $$ , demonstrating that the limiting expected fraction of vertices with rank ≤3$$ \\\\le 3 $$ is 0.9997$$ 0.9997 $$ … We show that with probability 1−n−0.99ε$$ 1-{n}^{-0.99\\\\varepsilon } $$ the highest rank of a vertex in the tree is sandwiched between (1−ε)logn/loglogn$$ \\\\left(1-\\\\varepsilon \\\\right)\\\\log n/\\\\mathrm{loglog}n $$ and (1.5+ε)logn/loglogn$$ \\\\left(1.5+\\\\varepsilon \\\\right)\\\\log n/\\\\mathrm{loglog}n $$ , and that this rank is asymptotic to logn/loglogn$$ \\\\log n/\\\\mathrm{loglog}n $$ with probability 1−o(1)$$ 1-o(1) $$ .\",\"PeriodicalId\":54523,\"journal\":{\"name\":\"Random Structures & Algorithms\",\"volume\":\"2013 1\",\"pages\":\"102 - 129\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Structures & Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21138\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/rsa.21138","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

我们证明了对于任意固定的k $$ k $$,一个随机增长的平面树的随机顶点的秩为k $$ k $$的概率,也就是说,一个随机顶点离叶子的距离为k $$ k $$的概率,随着树的大小n $$ n $$趋近于无穷大,收敛于一个常数ck $$ {c}_k $$。证明了1−∑j≤kck<22k+3(2k+4)!$$ 1-{\sum}_{j\le k}{c}_k<\frac{2^{2k+3}}{\left(2k+4\right)!} $$,使得极限秩分布的尾部是超指数窄的。我们证明后一个性质对所有有限n $$ n $$也一致成立。更一般地,我们证明了一个有限一致随机顶点集合的秩是渐近独立的,每个顶点的分布为{ck}$$ \left\{{c}_k\right\} $$。我们计算了0≤k≤3 $$ 0\le k\le 3 $$时ck $$ {c}_k $$的精确值,证明了秩≤3 $$ \le 3 $$的顶点的极限期望分数为0.9997 $$ 0.9997 $$ .我们证明了以1−n−0.99ε $$ 1-{n}^{-0.99\varepsilon } $$的概率,树中顶点的最高秩夹在(1−ε)logn/ loggn $$ \left(1-\varepsilon \right)\log n/\mathrm{loglog}n $$和(1.5+ε)logn/ loggn $$ \left(1.5+\varepsilon \right)\log n/\mathrm{loglog}n $$之间。这个秩是渐近于logn/loglog $$ \log n/\mathrm{loglog}n $$的概率是1 - 0 (1)$$ 1-o(1) $$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
We prove that for any fixed k$$ k $$ , the probability that a random vertex of a random increasing plane tree is of rank k$$ k $$ , that is, the probability that a random vertex is at distance k$$ k $$ from the leaves, converges to a constant ck$$ {c}_k $$ as the size n$$ n $$ of the tree goes to infinity. We prove that 1−∑j≤kck<22k+3(2k+4)!$$ 1-{\sum}_{j\le k}{c}_k<\frac{2^{2k+3}}{\left(2k+4\right)!} $$ , so that the tail of the limiting rank distribution is super‐exponentially narrow. We prove that the latter property holds uniformly for all finite n$$ n $$ as well. More generally, we prove that the ranks of a finite uniformly random set of vertices are asymptotically independent, each with distribution {ck}$$ \left\{{c}_k\right\} $$ . We compute the exact value of ck$$ {c}_k $$ for 0≤k≤3$$ 0\le k\le 3 $$ , demonstrating that the limiting expected fraction of vertices with rank ≤3$$ \le 3 $$ is 0.9997$$ 0.9997 $$ … We show that with probability 1−n−0.99ε$$ 1-{n}^{-0.99\varepsilon } $$ the highest rank of a vertex in the tree is sandwiched between (1−ε)logn/loglogn$$ \left(1-\varepsilon \right)\log n/\mathrm{loglog}n $$ and (1.5+ε)logn/loglogn$$ \left(1.5+\varepsilon \right)\log n/\mathrm{loglog}n $$ , and that this rank is asymptotic to logn/loglogn$$ \log n/\mathrm{loglog}n $$ with probability 1−o(1)$$ 1-o(1) $$ .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Random Structures & Algorithms
Random Structures & Algorithms 数学-计算机:软件工程
CiteScore
2.50
自引率
10.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness. Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信