Change search
ReferencesLink to record
Permanent link

Direct link
Hierarchy measures in complex networks
Umeå University, Faculty of Science and Technology, Physics.
Department of Physics, Brookhaven National Laboratory, Upton, New York 11973, USA.
Umeå University, Faculty of Science and Technology, Physics.
NORDITA, Blegdamsvej 17, 2100 Copenhagen Ø, Denmark.
2004 (English)In: Physical Review Letters, ISSN 0031-9007, Vol. 92, no 17, 178702- p.Article in journal (Refereed) Published
Abstract [en]

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.
URN: urn:nbn:se:umu:diva-4739DOI: 10.1103/PhysRevLett.92.178702OAI: diva2:143964
Available from: 2005-10-12 Created: 2005-10-12 Last updated: 2010-03-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Minnhagen, Petter
By organisation
In the same journal
Physical Review Letters

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link