Large deviation properties of minimum spanning trees for random graphs.

IF 2.5 3区 物理与天体物理 Q2 PHYSICS, FLUIDS & PLASMAS
Mahdi Sarikhani, Alexander K Hartmann
{"title":"Large deviation properties of minimum spanning trees for random graphs.","authors":"Mahdi Sarikhani, Alexander K Hartmann","doi":"10.1103/xc5g-t9dj","DOIUrl":null,"url":null,"abstract":"<p><p>We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with N nodes. First, we consider complete graphs. Second, we study Erdős-Rényi (ER) random graphs with edge probability p=c/N conditioned on being connected. By using large-deviation Markov-chain sampling, we can obtain the distribution P(W) of the spanning-tree weight W down to probability densities as small as 10^{-300}. For the complete graph, we confirm analytical predictions with respect to the expectation value. For both ensembles, the large-deviation principle is fulfilled. For the connected ER graphs, we observe a remarkable change of the distributions at the value of c=1, which is the percolation threshold for the original ER ensemble.</p>","PeriodicalId":48698,"journal":{"name":"Physical Review E","volume":"114 2-1","pages":"024314"},"PeriodicalIF":2.5000,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical Review E","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1103/xc5g-t9dj","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, FLUIDS & PLASMAS","Score":null,"Total":0}
引用次数: 0

Abstract

We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with N nodes. First, we consider complete graphs. Second, we study Erdős-Rényi (ER) random graphs with edge probability p=c/N conditioned on being connected. By using large-deviation Markov-chain sampling, we can obtain the distribution P(W) of the spanning-tree weight W down to probability densities as small as 10^{-300}. For the complete graph, we confirm analytical predictions with respect to the expectation value. For both ensembles, the large-deviation principle is fulfilled. For the connected ER graphs, we observe a remarkable change of the distributions at the value of c=1, which is the percolation threshold for the original ER ensemble.

随机图最小生成树的大偏差特性。
研究了两个N节点随机图集合的最小生成树的大偏差性质。首先,我们考虑完全图。其次,我们研究了边概率p=c/N为连通条件的Erdős-Rényi (ER)随机图。通过大偏差马尔可夫链抽样,我们可以得到生成树权值W的分布P(W),其概率密度小到10^{-300}。对于完全图,我们根据期望值确定分析预测。两种系统均满足大偏差原理。对于连通的ER图,我们观察到在原始ER集合的渗流阈值c=1处分布发生了显著变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Physical Review E
Physical Review E PHYSICS, FLUIDS & PLASMASPHYSICS, MATHEMAT-PHYSICS, MATHEMATICAL
CiteScore
4.50
自引率
16.70%
发文量
2110
期刊介绍: Physical Review E (PRE), broad and interdisciplinary in scope, focuses on collective phenomena of many-body systems, with statistical physics and nonlinear dynamics as the central themes of the journal. Physical Review E publishes recent developments in biological and soft matter physics including granular materials, colloids, complex fluids, liquid crystals, and polymers. The journal covers fluid dynamics and plasma physics and includes sections on computational and interdisciplinary physics, for example, complex networks.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书