Hierarchical Block Structures and High-Resolution Model Selection in Large Networks
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Social, technological, and biological networks are known to organize into modules or ``communities.'' Characterizing and identifying modules is highly nontrivial and still an outstanding problem in networks research. A new approach uses both the concept of modular hierarchy for network construction and the methods of statistical inference to address this problem, succeeding where the existing approaches see difficulties.
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 new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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 2×
“It is motivated by the desire to be able to characterize the most salient features in large biological [3–5], technological [6, 7] and social systems [3, 8, 9], such that their building blocks become evident, potentially giving valuable insight into the central aspects governing their function and evolution.”
BackgroundFinding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 2×
“A prominent problem in the detectability of block structures via other methods, such as modularity optimization [10] is when modules are merged together, regardless of how strong the community structure is perceived to be.”
BackgroundMethodFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 4×
“[2] Santo Fortunato, “Community detection in graphs,” Physics Reports 486, 75–174 (2010).”
BackgroundInfluentialFinding 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
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373 · cited 2×
“This type of approach should, in principle, also be applicable to other model classes, such as those based on overlapping [9, 83–85], or link communities [25, 86].”
BackgroundMethodMaps 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
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224 · cited 1×
“It is motivated by the desire to be able to characterize the most salient features in large biological [3–5], technological [6, 7] and social systems [3, 8, 9], such that their building blocks become evident, potentially giving valuable insight into the central aspects governing their function and…”
BackgroundFunctional cartography of complex metabolic networks
Guimerà, R., & Nunes Amaral, L. A. (2005) · Nature · doi:10.1038/nature03288 · Cited by 3,983 · cited 1×
“…also predict that it should serve as a more refined method of detecting missing information in networks [23, 44], as well as for the prediction of the network evolution [87], determining the more salient topological features [88, 89], or large-scale functional summaries of the network topology [90].”
MethodGoh, 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
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024 · cited 4×
“In addition to the lack of statistical validation, modularity maximization fails to detect clusters with size below a given threshold [14, 15], which increases with the size of the system as ∼ √ E , where E is the number of edges in the entire network.”
BackgroundMethodInfluentialThe political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
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×
“We also predict that it should serve as a more refined method of detecting missing information in networks [23, 44], as well as for the prediction of the network evolution [87], determining the more salient topological features [88, 89], or large-scale functional summaries of the network topology…”
BackgroundMethodStochastic blockmodels and community structure in networks
Karrer, B., & Newman, M. E. J. (2011) · Physical Review E · doi:10.1103/physreve.83.016107 · Cited by 2,025
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937 · cited 1×
“Furthermore, results obtained with this method tend to be degenerate for large empirical networks [16], for which many different partitions can be found with modularity values very close to the global maximum.”
MethodModularity from fluctuations in random graphs and complex networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2004) · Physical Review E · doi:10.1103/physreve.70.025101 · Cited by 894
Spatial Guilds in the Serengeti Food Web Revealed by a Bayesian Group Model
Baskerville, E. B., Dobson, A. P., Bedford, T., Allesina, S., Anderson, T. M., & Pascual, M. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002321 · Cited by 113 · cited 2×
“More recently, increasing effort has been spent on a different approach based on the statistical inference of generative models, which encodea the modular structure of the network as model parameters [17–28].”
MethodDynamic Networks from Hierarchical Bayesian Graph Clustering
Park, Y., Moore, C., & Bader, J. S. (2010) · PLoS ONE · doi:10.1371/journal.pone.0008118 · Cited by 34
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
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
MetaCell: analysis of single-cell RNA-seq data using K-nn graph partitions
Baran, Y., Bercovich, A., Sebe-Pedros, A., Lubling, Y., Giladi, A., Chomsky, E., Meir, Z., Hoichman, M., Lifshitz, A., & Tanay, A. (2019) · Genome Biology · doi:10.1186/s13059-019-1812-2 · Cited by 402
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Metadata
- Authors
- Peixoto, T. P.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2014-03-24
- Volume
- 4
- Issue
- 1
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W1928856156
- Cited by
- 248
- References
- 21
- FWCI
- 9.45
- 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.