• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

加权网络中的传输:划分为超级高速公路和道路。

Transport in weighted networks: partition into superhighways and roads.

作者信息

Wu Zhenhua, Braunstein Lidia A, Havlin Shlomo, Stanley H Eugene

机构信息

Center for Polymer Studies, Boston University, Boston, MA 02215, USA.

出版信息

Phys Rev Lett. 2006 Apr 14;96(14):148702. doi: 10.1103/PhysRevLett.96.148702. Epub 2006 Apr 13.

DOI:10.1103/PhysRevLett.96.148702
PMID:16712129
Abstract

Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes with the minimum total weight. We find that the MST can be partitioned into two distinct components, having significantly different transport properties, characterized by centrality--the number of times a node (or link) is used by transport paths. One component, superhighways, is the infinite incipient percolation cluster, for which we find that nodes (or links) with high centrality dominate. For the other component, roads, which includes the remaining nodes, low centrality nodes dominate. We find also that the distribution of the centrality for the infinite incipient percolation cluster satisfies a power law, with an exponent smaller than that for the entire MST. The significance of this finding is that one can improve significantly the global transport by improving a tiny fraction of the network, the superhighways.

摘要

加权网络中的传输由最小生成树(MST)主导,即连接所有节点且总权重最小的树。我们发现,最小生成树可分为两个截然不同的部分,它们具有显著不同的传输特性,以中心性来表征——节点(或链路)被传输路径使用的次数。其中一个部分是超级高速公路,它是无限初渗集群,我们发现具有高中心性的节点(或链路)在其中占主导地位。对于另一个部分,即包含其余节点的道路,低中心性节点占主导地位。我们还发现,无限初渗集群的中心性分布满足幂律,其指数小于整个最小生成树的指数。这一发现的意义在于,通过改善网络中极小的一部分,即超级高速公路,就能显著提高全局传输效率。

相似文献

1
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.
2
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.
3
Range-limited centrality measures in complex networks.复杂网络中的范围受限中心性度量
Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Jun;85(6 Pt 2):066103. doi: 10.1103/PhysRevE.85.066103. Epub 2012 Jun 6.
4
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.
5
Hierarchical clustering in minimum spanning trees.最小生成树中的层次聚类。
Chaos. 2015 Feb;25(2):023107. doi: 10.1063/1.4908014.
6
Percolation theory applied to measures of fragmentation in social networks.渗流理论应用于社会网络中的碎片化度量
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Apr;75(4 Pt 2):046107. doi: 10.1103/PhysRevE.75.046107. Epub 2007 Apr 13.
7
Robustness of a network formed by n interdependent networks with a one-to-one correspondence of dependent nodes.由n个相互依存网络形成的网络的稳健性,其中依存节点一一对应。
Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Jun;85(6 Pt 2):066134. doi: 10.1103/PhysRevE.85.066134. Epub 2012 Jun 29.
8
Analysis of relative influence of nodes in directed networks.有向网络中节点的相对影响力分析。
Phys Rev E Stat Nonlin Soft Matter Phys. 2009 Oct;80(4 Pt 2):046114. doi: 10.1103/PhysRevE.80.046114. Epub 2009 Oct 19.
9
Network evolution based on centrality.基于中心性的网络演化
Phys Rev E Stat Nonlin Soft Matter Phys. 2011 Nov;84(5 Pt 2):056108. doi: 10.1103/PhysRevE.84.056108. Epub 2011 Nov 21.
10
Most probable paths in temporal weighted networks: An application to ocean transport.时间加权网络中的最可能路径:在海洋运输中的应用
Phys Rev E Stat Nonlin Soft Matter Phys. 2015 Jul;92(1):012818. doi: 10.1103/PhysRevE.92.012818. Epub 2015 Jul 27.

引用本文的文献

1
Distribution of centrality measures on undirected random networks via the cavity method.通过腔方法研究无向随机网络上中心性度量的分布
Proc Natl Acad Sci U S A. 2024 Oct;121(40):e2403682121. doi: 10.1073/pnas.2403682121. Epub 2024 Sep 25.
2
Fractured columnar small-world functional network organization in volumes of L2/3 of mouse auditory cortex.小鼠听觉皮层第2/3层区域中柱状小世界功能网络组织的断裂
PNAS Nexus. 2024 Feb 12;3(2):pgae074. doi: 10.1093/pnasnexus/pgae074. eCollection 2024 Feb.
3
DomiRank Centrality reveals structural fragility of complex networks via node dominance.
度幂中心性通过节点主导性揭示复杂网络的结构脆弱性。
Nat Commun. 2024 Jan 2;15(1):56. doi: 10.1038/s41467-023-44257-0.
4
Identification, cost evaluation, and prioritization of urban traffic congestions and their origin.识别、成本评估和优先排序城市交通拥堵及其根源。
Sci Rep. 2022 Jul 29;12(1):13026. doi: 10.1038/s41598-022-17404-8.
5
Special Patterns of Dynamic Brain Networks Discriminate Between Face and Non-face Processing: A Single-Trial EEG Study.动态脑网络的特殊模式可区分面部与非面部加工:一项单试次脑电图研究
Front Neurosci. 2021 Jun 9;15:652920. doi: 10.3389/fnins.2021.652920. eCollection 2021.
6
Brain Connectivity and Information-Flow Breakdown Revealed by a Minimum Spanning Tree-Based Analysis of MRI Data in Behavioral Variant Frontotemporal Dementia.基于最小生成树的行为变异型额颞叶痴呆MRI数据分析揭示的脑连接性和信息流中断
Front Neurosci. 2019 Mar 14;13:211. doi: 10.3389/fnins.2019.00211. eCollection 2019.
7
A Pólya urn approach to information filtering in complex networks.复杂网络中的信息过滤的 Pólya urn 方法。
Nat Commun. 2019 Feb 14;10(1):745. doi: 10.1038/s41467-019-08667-3.
8
Statistical methods for constructing disease comorbidity networks from longitudinal inpatient data.从纵向住院数据构建疾病共病网络的统计方法。
Appl Netw Sci. 2018;3(1):46. doi: 10.1007/s41109-018-0101-4. Epub 2018 Nov 7.
9
From the betweenness centrality in street networks to structural invariants in random planar graphs.从街道网络的中间中心性到随机平面图的结构不变量。
Nat Commun. 2018 Jun 27;9(1):2501. doi: 10.1038/s41467-018-04978-z.
10
The angular nature of road networks.道路网络的角度特性。
Sci Rep. 2017 Jun 27;7(1):4312. doi: 10.1038/s41598-017-04477-z.