Hierarchy Measure for Complex Networks
Open accessThe DOI matches its Crossref record; 66 of the 69 references it cites were found in a registry or an index.
Abstract
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures









Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Awell established concept where such questions are addressed involves the use of a morphospace [32-36] namely a phenotype space where a small set of quantitative traits can be defined as the axes.”
From On the origins of hierarchy in complex networks (2013) · cites this paper as [33]
In the citing paper
“Layers can be identified through a backward or bottom up leaf removal ( LR b ) algorithm or through a forward or top down leaf removal ( LR f ) algorithm [33].”
From On the origins of hierarchy in complex networks (2013) · cites this paper as [33]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
1 retracted
Retracted: Detecting Hidden Hierarchy in Terrorist Networks: Some Case Studies
Memon, N., Larsen, H. L., Hicks, D. L., & Harkiolakis, N. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69304-8_50 · Cited by 60
Retracted(1979) · Cited by 43,841
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060 · cited 1×
“Metabolic B is an end product of A C. elegans [48] 1173 2.442 0.048 0.052 E. coli [48] 2275 2.533 0.043 0.058 S. cerevisiae [48] 1511 2.537 0.037 0.042 Neuronal A synapse goes from A to B C. elegans [49,50] 297 7.943 0.133 0.023 Macaque brain [51] 45 10.289 0 0 Internet A communicates with B p2p-1 [52,53] 10876 3.677…”
InfluentialEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
The igraph software package for complex network research
Csárdi, G., & Nepusz, T. (2006) · Medical Entomology and Zoology · Cited by 13,507
Harary, F. (1969) · Cited by 10,739
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Bollobás, B. (1985) · Cited by 6,196
Research works printed but not linked: 3
- Pastor-Satorras R Vespignani A 2004 Evolution and Strcuture of the Internet Cambridge Cambridge University Press
- Healy P Nikolov NS 2004 Hierarchical drawind algorithms St Helier, NJ CRC Press
- Grinstead CM Snell JL 1997 Introduction to Probability, Second Revised Edition Washington, D.C. American Mathematical Society
Cited by
Structure and dynamics of molecular networks: A novel paradigm of drug discovery
Csermely, P., Korcsmáros, T., Kiss, H. J. M., London, G., & Nussinov, R. (2013) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2013.01.016 · Cited by 892
Controlling edge dynamics in complex networks
Nepusz, T., & Vicsek, T. (2012) · Nature Physics · doi:10.1038/nphys2327 · Cited by 430
Self-citationGriffiths phases and the stretching of criticality in brain networks
Moretti, P., & Muñoz, M. A. (2013) · Nature Communications · doi:10.1038/ncomms3521 · Cited by 363
Emergence of bimodality in controlling complex networks
Jia, T., Liu, Y.-Y., Csóka, E., Pósfai, M., Slotine, J.-J., & Barabási, A.-L. (2013) · Nature Communications · doi:10.1038/ncomms3002 · Cited by 220
Effect of correlations on network controllability
Pósfai, M., Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2013) · Scientific Reports · doi:10.1038/srep01067 · Cited by 203
Metadata
- Authors
- Mones, E., Vicsek, L., & Vicsek, T.
- Affiliations
- Eötvös Loránd University (HU)
- Corvinus University of Budapest (HU)
- Corresponding author
- Vicsek, Tamás
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2012-03-28
- Volume
- 7
- Issue
- 3
- Pages
- e33799
- ISSN
- 1932-6203 (ISSN-L)
- PMC
- PMC3314676
- OpenAlex
- W2084974221
- Cited by
- 259
- References
- 69
- Citations by year
- 2026: 8 · 2025: 18 · 2024: 24 · 2023: 18 · 2022: 13 · 2021: 22 · 2020: 41 · 2019: 21 · 2018: 16 · 2017: 14 · 2016: 18 · 2015: 9 · 2014: 15 · 2013: 18 · 2012: 4
- FWCI
- 11.15
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- PLoS ONE (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University) (submittedVersion, other-oa)
- arXiv (Cornell University)
- Funders
- FP7 Ideas: European Research Council (227878)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Keywords
- network hierarchy, complex networks, directed graphs, network controllability, network visualization
- MeSH terms
- Algorithms, Humans, Models, Theoretical, Neural Networks, Computer, Community Networks, Internet, Metabolic Networks and Pathways, Social Networking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.