Hierarchy Measures in Complex Networks
| dc.creator | Trusina, Ala | |
| dc.creator | Maslov, Sergei | |
| dc.creator | Minnhagen, Petter | |
| dc.creator | Sneppen, Kim | |
| dc.date | 2003-08-18 | |
| dc.date | 2004-02-19 | |
| dc.date.accessioned | 2026-07-07T09:46:12Z | |
| dc.date.available | 2026-07-07T09:46:12Z | |
| dc.description | 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 $γ$ -- the exponent of a degree distribution -- reaching its highest possible value for $γ\leq 2$ and quickly approaching zero for $γ>3$. | |
| dc.description | 4 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0308339 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0308339 | |
| dc.identifier | Phys. Rev. Lett. 92, 178702 (2004) | |
| dc.identifier | doi:10.1103/PhysRevLett.92.178702 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163452 | |
| dc.subject | Soft Condensed Matter | |
| dc.subject | Molecular Networks | |
| dc.title | Hierarchy Measures in Complex Networks | |
| dc.type | text |