The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems
Open accessAbstract
To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network--the optimal number of levels and modular partition at each level--with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines: life sciences, physical sciences, ecology and earth sciences, and social sciences. In general, we find shallow hierarchical structures in globally interconnected systems, such as neural networks, and rich multilevel organizations in systems with highly separated regions, such as road networks.
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 Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
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 · cited 1×
“(4) At each submodule level, q is the rate of codeword use for entering the mi submodules or exiting to a coarser level and H(Q) is the frequency-weighted average length of the codewords in the subindex codebook.”
BackgroundFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“But many networks have important structures at multiple scales (3), and the code structure of the two-level map equation cannot capitalize on these.”
BackgroundFinding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Maps of random walks on complex networks reveal community structure
Rosvall, M., & Bergstrom, C. T. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706851105 · Cited by 4,583
Self-citationGoh, K.-I., Cusick, M. E., Valle, D., Childs, B., Vidal, M., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701361104 · Cited by 3,242
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Community detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 2×
“w that is associated with movements into the mi ner levels of the hierarchy fqij x g. The relative rate of codeword use is Qi= q i y =q ;q i1 x =q ;:::;q imi x =q i , where qi = q i y + Xmi j=1 qij x (9) is the total codeword use. The Shannon information of movements in this submodule, weighted by how often the code i…”
BackgroundInfluentialHierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Link communities reveal multiscale complexity in networks
Ahn, Y.-Y., Bagrow, J. P., & Lehmann, S. (2010) · Nature · doi:10.1038/nature09182 · Cited by 1,949
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Guimerà, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407994102 · Cited by 1,762
Modularity in development and evolution
Schlosser, G., & Thieffry, D. (2000) · BioEssays · doi:10.1002/1521-1878(200011)22:11<1043::aid-bies11>3.0.co;2-c · Cited by 891
Rosvall, M., Axelsson, D., & Bergstrom, C. T. (2009) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2010-01179-1 · Cited by 844
Self-citationMapping Change in Large Networks
Rosvall, M., & Bergstrom, C. T. (2010) · PLoS ONE · doi:10.1371/journal.pone.0008694 · Cited by 630
Self-citationExtracting 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
Advances in Minimum Description Length: Theory and Applications
Grünwald, P., Myung, I. J., & Pitt, M. A. (2005) · Data Archiving and Networked Services (DANS) · Cited by 408
Finding community structure in mega-scale social networks: [extended abstract]
Wakita, K., & Tsurumi, T. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242805 · Cited by 396
Kovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
Multiresolution community detection for megascale networks by information-based replica correlations
Ronhovde, P., & Nussinov, Z. (2009) · Physical Review E · doi:10.1103/physreve.80.016109 · Cited by 245
Networks and Cities: An Information Perspective
Rosvall, M., Trusina, A., Minnhagen, P., & Sneppen, K. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.028701 · Cited by 239
Self-citationVarieties of modules: Kinds, levels, origins, and behaviors
Winther, R. G. (2001) · Journal of Experimental Zoology · doi:10.1002/jez.1064 · Cited by 179
Organization of Excitable Dynamics in Hierarchical Biological Networks
Müller‐Linow, M., Hilgetag, C. C., & Hütt, M. ‐. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000190 · Cited by 159
Cited by
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
Finding Statistically Significant Communities in Networks
Lancichinetti, A., Radicchi, F., Ramasco, J. J., & Fortunato, S. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018961 · Cited by 1,187
The Role of Gender in Scholarly Authorship
West, J. D., Jacquet, J., King, M. M., Correll, S. J., & Bergstrom, C. T. (2013) · PLoS ONE · doi:10.1371/journal.pone.0066212 · Cited by 892
Self-citationStructure 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
Communities, modules and large-scale structure in networks
Newman, M. E. J. (2012) · Nature Physics · doi:10.1038/nphys2162 · Cited by 787
Metadata
- Authors
- Rosvall, M., & Bergstrom, C. T.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2011-04-08
- Volume
- 6
- Issue
- 4
- Pages
- e18209
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W1743429370
- Cited by
- 393
- References
- 29
- FWCI
- 21.91
- Type
- journal article
- Language
- en
- Open access
- gold
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.