随机树中点之间的距离

A. Meir, J.W. Moon
{"title":"随机树中点之间的距离","authors":"A. Meir,&nbsp;J.W. Moon","doi":"10.1016/S0021-9800(70)80012-6","DOIUrl":null,"url":null,"abstract":"<div><p>Let <em>γ</em> denote the number of points in the path joining two arbitrary points in a random tree <em>T<sub>n</sub></em> with <em>n</em> labeled points. It is shown, among other things, that <em>E(γ)∼(1/2πn)</em><sup>1/2</sup>.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 99-103"},"PeriodicalIF":0.0000,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80012-6","citationCount":"42","resultStr":"{\"title\":\"The distance between points in random trees\",\"authors\":\"A. Meir,&nbsp;J.W. Moon\",\"doi\":\"10.1016/S0021-9800(70)80012-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <em>γ</em> denote the number of points in the path joining two arbitrary points in a random tree <em>T<sub>n</sub></em> with <em>n</em> labeled points. It is shown, among other things, that <em>E(γ)∼(1/2πn)</em><sup>1/2</sup>.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 1\",\"pages\":\"Pages 99-103\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80012-6\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42

摘要

设γ表示有n个标记点的随机树Tn中连接任意两个点的路径上的点数。结果表明,除其他外,E(γ) ~ (1/2πn)1/2。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The distance between points in random trees

Let γ denote the number of points in the path joining two arbitrary points in a random tree Tn with n labeled points. It is shown, among other things, that E(γ)∼(1/2πn)1/2.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信