Percolation in simple directed random graphs with a given degree distribution

IF 0.7 3区 工程技术 Q4 ENGINEERING, INDUSTRIAL Probability in the Engineering and Informational Sciences Pub Date : 2023-05-05 DOI:10.1017/s0269964823000128
Femke van Ieperen, I. Kryven
{"title":"Percolation in simple directed random graphs with a given degree distribution","authors":"Femke van Ieperen, I. Kryven","doi":"10.1017/s0269964823000128","DOIUrl":null,"url":null,"abstract":"\n We study site and bond percolation in simple directed random graphs with a given degree distribution. We derive the percolation threshold for the giant strongly connected component and the fraction of vertices in this component as a function of the percolation probability. The results are obtained for degree sequences in which the maximum degree may depend on the total number of nodes n, being asymptotically bounded by \n \n \n $n^{\\frac{1}{9}}$\n \n .","PeriodicalId":54582,"journal":{"name":"Probability in the Engineering and Informational Sciences","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Probability in the Engineering and Informational Sciences","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1017/s0269964823000128","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

We study site and bond percolation in simple directed random graphs with a given degree distribution. We derive the percolation threshold for the giant strongly connected component and the fraction of vertices in this component as a function of the percolation probability. The results are obtained for degree sequences in which the maximum degree may depend on the total number of nodes n, being asymptotically bounded by $n^{\frac{1}{9}}$ .
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有给定度分布的简单有向随机图中的渗流
我们研究了具有给定度分布的简单有向随机图中的点和键的渗透。我们导出了巨强连通分量的渗透阈值和该分量中作为渗透概率函数的顶点分数。得到度序列的结果,其中最大度依赖于节点总数n,渐近地以$n^{\frac{1}{9}}$为界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.20
自引率
18.20%
发文量
45
审稿时长
>12 weeks
期刊介绍: The primary focus of the journal is on stochastic modelling in the physical and engineering sciences, with particular emphasis on queueing theory, reliability theory, inventory theory, simulation, mathematical finance and probabilistic networks and graphs. Papers on analytic properties and related disciplines are also considered, as well as more general papers on applied and computational probability, if appropriate. Readers include academics working in statistics, operations research, computer science, engineering, management science and physical sciences as well as industrial practitioners engaged in telecommunications, computer science, financial engineering, operations research and management science.
期刊最新文献
On the probability of a Pareto record Quantile-based information generating functions and their properties and uses Orderings of extremes among dependent extended Weibull random variables An inequality for log-concave functions and its use in the study of failure rates Discounted cost exponential semi-Markov decision processes with unbounded transition rates: a service rate control problem with impatient customers
×
引用
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