The number of descendants in a random directed acyclic graph

IF 0.9 3区 数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Random Structures & Algorithms Pub Date : 2023-11-07 DOI:10.1002/rsa.21195
Svante Janson
{"title":"The number of descendants in a random directed acyclic graph","authors":"Svante Janson","doi":"10.1002/rsa.21195","DOIUrl":null,"url":null,"abstract":"Abstract We consider a well‐known model of random directed acyclic graphs of order , obtained by recursively adding vertices, where each new vertex has a fixed outdegree and the endpoints of the edges from it are chosen uniformly at random among previously existing vertices. Our main results concern the number of vertices that are descendants of . We show that converges in distribution; the limit distribution is, up to a constant factor, given by the th root of a Gamma distributed variable with distribution . When , the limit distribution can also be described as a chi distribution . We also show convergence of moments, and find thus the asymptotics of the mean and higher moments.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"54 4","pages":"0"},"PeriodicalIF":0.9000,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/rsa.21195","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract We consider a well‐known model of random directed acyclic graphs of order , obtained by recursively adding vertices, where each new vertex has a fixed outdegree and the endpoints of the edges from it are chosen uniformly at random among previously existing vertices. Our main results concern the number of vertices that are descendants of . We show that converges in distribution; the limit distribution is, up to a constant factor, given by the th root of a Gamma distributed variable with distribution . When , the limit distribution can also be described as a chi distribution . We also show convergence of moments, and find thus the asymptotics of the mean and higher moments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随机有向无环图中后代的数目
我们考虑了一个众所周知的有序随机有向无环图模型,该模型通过递归添加顶点获得,其中每个新顶点具有固定的出界度,并且其边缘的端点在先前存在的顶点中随机选择。我们的主要结果与的后代顶点的数量有关。我们证明它在分布上是收敛的;极限分布是,直到一个常数因子,由一个具有分布的分布变量的根号给出。时,极限分布也可以描述为chi分布。我们还证明了矩的收敛性,并由此找到了均值矩和高矩的渐近性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Sharp thresholds in adaptive random graph processes The number of descendants in a random directed acyclic graph Counting orientations of random graphs with no directed k‐cycles Prominent examples of flip processes Defective coloring of hypergraphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1