• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

复杂网络传输主干的分类

Classification of transport backbones of complex networks.

作者信息

Choi Woosik, Chae Huiseung, Yook Soon-Hyung, Kim Yup

机构信息

Department of Physics and Research Institute for Basic Sciences, Kyung Hee University, Seoul 130-701, Korea.

出版信息

Phys Rev E Stat Nonlin Soft Matter Phys. 2013 Dec;88(6):060802. doi: 10.1103/PhysRevE.88.060802. Epub 2013 Dec 17.

DOI:10.1103/PhysRevE.88.060802
PMID:24483375
Abstract

Transport properties in random and scale-free (SF) networks are studied by analyzing the betweenness centrality (BC) distribution P(B) in the minimum spanning trees (MSTs) and infinite incipient percolation clusters (IIPCs) of the networks. It is found that P(B) in MSTs scales as P(B)∼B(-δ). The obtained values of δ are classified into two different categories, δ≃1.6 and δ≃2.0. Using the mapping between BC and the branch size of tree structures, it is proved that δ in MSTs which are close to critical trees is 1.6. In contrast, δ in MSTs which are supercritical trees is shown to be 2.0. We also find δ=1.5 in IIPCs, which is a natural result because IIPC is physically critical. Based on the results in MSTs, a physical reason why δ≥2 in the original networks is suggested.

摘要

通过分析网络的最小生成树(MST)和无限初渗簇(IIPC)中的中介中心性(BC)分布P(B),研究了随机网络和无标度(SF)网络中的输运性质。研究发现,MST中的P(B)按P(B)∼B^(-δ)缩放。得到的δ值分为两类,δ≃1.6和δ≃2.0。利用BC与树结构分支大小之间的映射关系,证明了接近临界树的MST中的δ为1.6。相比之下,超临界树的MST中的δ为2.0。我们还在IIPC中发现δ = 1.5,这是一个自然的结果,因为IIPC在物理上是临界的。基于MST的结果,提出了原始网络中δ≥2的物理原因。

相似文献

1
Classification of transport backbones of complex networks.复杂网络传输主干的分类
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 Dec;88(6):060802. doi: 10.1103/PhysRevE.88.060802. Epub 2013 Dec 17.
2
Scale-free trees: the skeletons of complex networks.无标度树:复杂网络的骨架
Phys Rev E Stat Nonlin Soft Matter Phys. 2004 Oct;70(4 Pt 2):046126. doi: 10.1103/PhysRevE.70.046126. Epub 2004 Oct 28.
3
Hierarchical clustering in minimum spanning trees.最小生成树中的层次聚类。
Chaos. 2015 Feb;25(2):023107. doi: 10.1063/1.4908014.
4
Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks.分形和非分形无标度模型网络的中介中心性及对真实网络的测试
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 May;75(5 Pt 2):056115. doi: 10.1103/PhysRevE.75.056115. Epub 2007 May 31.
5
Fractality in complex networks: critical and supercritical skeletons.复杂网络中的分形性:临界和超临界骨架
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Jan;75(1 Pt 2):016110. doi: 10.1103/PhysRevE.75.016110. Epub 2007 Jan 29.
6
Transport in weighted networks: partition into superhighways and roads.加权网络中的传输:划分为超级高速公路和道路。
Phys Rev Lett. 2006 Apr 14;96(14):148702. doi: 10.1103/PhysRevLett.96.148702. Epub 2006 Apr 13.
7
Theory of minimum spanning trees. I. Mean-field theory and strongly disordered spin-glass model.最小生成树理论。I. 平均场理论与强无序自旋玻璃模型。
Phys Rev E Stat Nonlin Soft Matter Phys. 2010 Feb;81(2 Pt 1):021130. doi: 10.1103/PhysRevE.81.021130. Epub 2010 Feb 25.
8
Not seeing the forest for the trees: size of the minimum spanning trees (MSTs) forest and branch significance in MST-based phylogenetic analysis.只见树木不见森林:基于最小生成树(MST)的系统发育分析中最小生成树森林的大小及分支意义
PLoS One. 2015 Mar 23;10(3):e0119315. doi: 10.1371/journal.pone.0119315. eCollection 2015.
9
Susceptibility and percolation in two-dimensional random field Ising magnets.二维随机场伊辛磁体中的易感性与逾渗
Phys Rev E Stat Nonlin Soft Matter Phys. 2001 Jun;63(6 Pt 2):066109. doi: 10.1103/PhysRevE.63.066109. Epub 2001 May 18.
10
Betweenness centrality in a weighted network.加权网络中的中介中心性。
Phys Rev E Stat Nonlin Soft Matter Phys. 2008 Apr;77(4 Pt 2):046105. doi: 10.1103/PhysRevE.77.046105. Epub 2008 Apr 7.