Hierarchy measures in complex networks
2004 (English)In: Physical Review Letters, ISSN 0031-9007, Vol. 92, no 17, 178702- p.Article in journal (Refereed) Published
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 y, the exponent of a degree distribution, reaching its highest possible value for y ≤,2 and quickly approaching zero for y > 3.
Place, publisher, year, edition, pages
The American Physical Society , 2004. Vol. 92, no 17, 178702- p.
IdentifiersURN: urn:nbn:se:umu:diva-4739DOI: 10.1103/PhysRevLett.92.178702OAI: oai:DiVA.org:umu-4739DiVA: diva2:143964