期刊
PHYSICAL REVIEW LETTERS
卷 92, 期 17, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.92.178702
关键词
-
Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally hierarchical. Comparison with these extremal cases as well as with random scale-free networks allows us to better understand hierarchical versus modular features in several real-life complex networks. For random scale-free topologies the extent of topological hierarchy is shown to smoothly decline with gamma, the exponent of a degree distribution, reaching its highest possible value for gammaless than or equal to2 and quickly approaching zero for gamma>3.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据