CoChat

Hierarchy Measure for Complex Networks

Open access

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pone.0033799

Cites

66 of 66 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 An adjustable hierarchical network with the different edge types. The blue edges belong to the original arborescence graph that is used as the backbone of the adjustable hierarchical (AH) network. There are three type of possible edges added to the graph: down edges (green), horizontal edges (orange) and up edges (red). They have different effects on the hierarchical structure of the directed tree. Down edges conserve the hierarchy, horizontal edges has a slight influence and up edges make strong changes in the structure.
Figure 1 An adjustable hierarchical network with the different edge types. The blue edges belong to the original arborescence graph that is used as the backbone of the adjustable hierarchical (AH) network. There are three type of possible edges added to the graph: down edges (green), horizontal edges (orange) and up edges (red). They have different effects on the hierarchical structure of the directed tree. Down edges conserve the hierarchy, horizontal edges has a slight influence and up edges make strong changes in the structure.CC BY · PubMed Central
Figure 2 Distribution of the local reaching centrality for the adjustable hierarchical network. Distribution of the local reaching centrality in the adjustable hierarchical (AH) network model at different parameter values. Each distribution is averaged over 1000 AH networks with and . The standard deviations of the distributions are comparable to the averages only for relative frequencies less than 0.002. Note that from the (highly random) to the (fully hierarchical) state the distribution changes continuously and monotonously with .
Figure 2 Distribution of the local reaching centrality for the adjustable hierarchical network. Distribution of the local reaching centrality in the adjustable hierarchical (AH) network model at different parameter values. Each distribution is averaged over 1000 AH networks with and . The standard deviations of the distributions are comparable to the averages only for relative frequencies less than 0.002. Note that from the (highly random) to the (fully hierarchical) state the distribution changes continuously and monotonously with .CC BY · PubMed Central
Figure 3 The global reaching centrality at different p values in the adjustable hierarchical model. All curves show averages over an ensemble of 1000 networks with and different average degrees. Standard deviations grow with , but they are clearly below the average values of the GRC. Note that for larger density, it is less likely to obtain the same level of hierarchy.
Figure 3 The global reaching centrality at different p values in the adjustable hierarchical model. All curves show averages over an ensemble of 1000 networks with and different average degrees. Standard deviations grow with , but they are clearly below the average values of the GRC. Note that for larger density, it is less likely to obtain the same level of hierarchy.CC BY · PubMed Central
Figure 4 The global reaching centrality versus average degree in the Erdös–Rényi and scale-free networks. Dots show averages for 1000 graphs with nodes. In the Erdös–Rényi and scale-free networks, standard deviations of the GRC are comparable with its averages only for and , respectively.
Figure 4 The global reaching centrality versus average degree in the Erdös–Rényi and scale-free networks. Dots show averages for 1000 graphs with nodes. In the Erdös–Rényi and scale-free networks, standard deviations of the GRC are comparable with its averages only for and , respectively.CC BY · PubMed Central
Figure 5 Visualization of three network types based on the local reaching centrality. Visualization of (A) an Erdös–Rényi (ER) network, (B) a scale-free (SF) network and (C) a directed tree with random branching number between 1 and 5. All three graphs have nodes and the ER and SF graphs have . In each network was set to .
Figure 5 Visualization of three network types based on the local reaching centrality. Visualization of (A) an Erdös–Rényi (ER) network, (B) a scale-free (SF) network and (C) a directed tree with random branching number between 1 and 5. All three graphs have nodes and the ER and SF graphs have . In each network was set to .CC BY · PubMed Central
Figure 6 Diagram illustrating the process of visualizing an ensemble of networks. First, we compute the layout based on the selected local quantity for each graph in the ensemble (top right). Next, we separate the levels logarithmically and scale each layout into the unit square (bottom left). Last, we overlay all rescaled layouts and plot the obtained density of nodes in the unit square (bottom right, see color scale also). In the heat maps, the color scale shows , where is the average density of the ensemble.
Figure 6 Diagram illustrating the process of visualizing an ensemble of networks. First, we compute the layout based on the selected local quantity for each graph in the ensemble (top right). Next, we separate the levels logarithmically and scale each layout into the unit square (bottom left). Last, we overlay all rescaled layouts and plot the obtained density of nodes in the unit square (bottom right, see color scale also). In the heat maps, the color scale shows , where is the average density of the ensemble.CC BY · PubMed Central
Figure 7 Visualization of network ensembles. Visualizations of the (A) Erdös–Rényi, (B) scale-free, (C) directed tree and (D)–(L) AH network ensembles (subfigures (D)–(L) are for different values of the model parameter: ). In each case the color scale shows where is the density averaged over 1000 graphs. and were set. In every network, was set to . The corresponding GRC values are: 0.997 (A), 0.058 (B), 0.127 (C), 0.135 (D), 0.161 (E), 0.194 (F), 0.238 (G), 0.290 (H), 0.361 (I), 0.452 (J), 0.581 (K) and 0.775 (L).
Figure 7 Visualization of network ensembles. Visualizations of the (A) Erdös–Rényi, (B) scale-free, (C) directed tree and (D)–(L) AH network ensembles (subfigures (D)–(L) are for different values of the model parameter: ). In each case the color scale shows where is the density averaged over 1000 graphs. and were set. In every network, was set to . The corresponding GRC values are: 0.997 (A), 0.058 (B), 0.127 (C), 0.135 (D), 0.161 (E), 0.194 (F), 0.238 (G), 0.290 (H), 0.361 (I), 0.452 (J), 0.581 (K) and 0.775 (L).CC BY · PubMed Central
Figure 8 Visualization of real networks. The hierarchy-based visualization of (A) the GrassLand food web, (B) the electrical circuit benchmark s9234, (C) the transcriptional regulatory network of yeast and (D) the core of the Enron network. In every network was set to .
Figure 8 Visualization of real networks. The hierarchy-based visualization of (A) the GrassLand food web, (B) the electrical circuit benchmark s9234, (C) the transcriptional regulatory network of yeast and (D) the core of the Enron network. In every network was set to .CC BY · PubMed Central
Figure 9 Distributions of the local reaching centrality for different network types. For each network type and for the Erdös–Rényi (ER) and scale-free (SF) networks . All curves show averages of the distributions over an ensemble of 1000 graphs. Standard deviations are comparable with the averages only near the peaks in the ER and SF models. Although the standard deviations at the peaks are large, they do not change the positions of the peaks, and thus, do not affect the distributions.
Figure 9 Distributions of the local reaching centrality for different network types. For each network type and for the Erdös–Rényi (ER) and scale-free (SF) networks . All curves show averages of the distributions over an ensemble of 1000 graphs. Standard deviations are comparable with the averages only near the peaks in the ER and SF models. Although the standard deviations at the peaks are large, they do not change the positions of the peaks, and thus, do not affect the distributions.CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 66 references

Research works printed but not linked: 3

  1. Pastor-Satorras R Vespignani A 2004 Evolution and Strcuture of the Internet Cambridge Cambridge University Press
  2. Healy P Nikolov NS 2004 Hierarchical drawind algorithms St Helier, NJ CRC Press
  3. Grinstead CM Snell JL 1997 Introduction to Probability, Second Revised Edition Washington, D.C. American Mathematical Society

Cited by

Items 101–200 of 264

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
Published
2012-03-28
Volume
7
Issue
3
Pages
e33799
ISSN
1932-6203 (ISSN-L)
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
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.