Hierarchy Measures in Complex Networks
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
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 gamma, the exponent of a degree distribution, reaching its highest possible value for gamma</=2 and quickly approaching zero for gamma>3.
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
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.
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
A comprehensive two-hybrid analysis to explore the yeast protein interactome
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.061034498 · Cited by 3,566
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Self-citationDorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
Hui, P., Crowcroft, J., & Yoneki, E. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.246 · Cited by 1,515
Hierarchical Organization of Human Cortical Networks in Health and Schizophrenia
Bassett, D. S., Bullmore, E., Verchinski, B. A., Mattay, V. S., Weinberger, D. R., & Meyer-Lindenberg, A. (2008) · The Journal of Neuroscience · doi:10.1523/jneurosci.1929-08.2008 · Cited by 1,229
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Boguñá, M. (2010) · Physical Review E · doi:10.1103/physreve.82.036106 · Cited by 1,059
Bubble rap: social-based forwarding in delay tolerant networks
Hui, P., Crowcroft, J., & Yoneki, E. (2008) · Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1374618.1374652 · Cited by 814
Extracting the hierarchical organization of complex systems
Sales-Pardo, M., Guimerà, R., Moreira, A. A., & Amaral, L. A. N. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0703740104 · Cited by 535
Metadata
- Authors
- Trusina, A., Maslov, S., Minnhagen, P., & Sneppen, K.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-04-29
- Volume
- 92
- Issue
- 17
- Pages
- 178702-178702
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2041681134
- Cited by
- 137
- References
- 3
- FWCI
- 9.10
- Type
- journal article
- Language
- en
- Open access
- green
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.