Hierarchy measures in complex networks

Ala Trusina, Sergei Maslov, Petter Minnhagen, Kim Sneppen

Research output: Contribution to journalArticlepeer-review

Abstract

The topological hierarchy of a complex network was analyzed using each node's degree as a proxy for its importance. A simple dynamical process used to construct networks which are either maximally or minimally hierarchical was proposed. The hierarchical structure was quantified as the fraction of shortest paths that are also hierarchical. The results show that for random scale-free topologies the extent of topological hierarchy smoothly decline with γ, the exponent of a degree distribution, reaching its highest possible value for γ ≤ 2 and quickly approaching zero for γ > 3.

Original languageEnglish (US)
Article number178702
Pages (from-to)178702-1-178702-4
JournalPhysical review letters
Volume92
Issue number17
DOIs
StatePublished - Apr 30 2004
Externally publishedYes

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'Hierarchy measures in complex networks'. Together they form a unique fingerprint.

Cite this