The DOI matches its Crossref record; 75 of the 75 references it cites were found in a registry or an index.
Higher-order organization of complex networks
Open accessAbstract
Resolving a network of hubs: Graphs are a pervasive tool for modeling and analyzing network data throughout the sciences. Benson et al.developed an algorithmic framework for studying how complex networks are organized by higher-order connectivity patterns (see the Perspective by Pržulj and Malod-Dognin). Motifs in transportation networks reveal hubs and geographical elements not readily achievable by other methods. A motif previously suggested as important for neuronal networks is part of a “rich club” of subnetworks. Science, this issue p.163; see also p.123
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
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
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
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
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
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
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Network motifs: theory and experimental approaches
Alon, U. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2102 · Cited by 3,279
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
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
Zitnik, M., Nguyen, F., Wang, B., Leskovec, J., Goldenberg, A., & Hoffman, M. M. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.09.012 · Cited by 675
Self-citationLocal Higher-Order Graph Clustering
Yin, H., Benson, A. R., Leskovec, J., & Gleich, D. F. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098069 · Cited by 583
Self-citationDynamics on higher-order networks: a review
Majhi, S., Perc, M., & Ghosh, D. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0043 · Cited by 561
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
Self-citationParanjape, A., Benson, A. R., & Leskovec, J. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018731 · Cited by 540
Self-citationFrom networks to optimal higher-order models of complex systems
Lambiotte, R., Rosvall, M., & Scholtes, I. (2019) · Nature Physics · doi:10.1038/s41567-019-0459-y · Cited by 483
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
The Why, How, and When of Representations for Complex Systems
Torres, L., Blevins, A. S., Bassett, D., & Eliassi-Rad, T. (2021) · SIAM Review · doi:10.1137/20m1355896 · Cited by 297
Metrics for Community Analysis: A Survey
Chakraborty, T., Dalmia, A., Mukherjee, A., & Ganguly, N. (2018) · ACM Computing Surveys · doi:10.1145/3091106 · Cited by 296
Vaast, E., Safadi, H., Lapointe, L., & Negoita, B. (2017) · MIS Quarterly · doi:10.25300/misq/2017/41.4.08 · Cited by 289
Shen, B., Wang, Z., Wang, D., & Li, Q. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2946290 · Cited by 267
Bianconi, G. (2021) · doi:10.1017/9781108770996 · Cited by 223
Evolution of resilience in protein interactomes across the tree of life
Zitnik, M., Sosič, R., Feldman, M. W., & Leskovec, J. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1818013116 · Cited by 130
Self-citationColonna, G. (2024) · Livers · doi:10.3390/livers4020016 · Cited by 7
Making Recommender Systems Forget: Learning and Unlearning for Erasable Recommendation
Li, Y., Zheng, X., Chen, C., & Liu, J. (2022) · arXiv · doi:10.48550/arxiv.2203.11491 · Cited by 43
Metadata
- Authors
- Benson, A. R., Gleich, D. F., & Leskovec, J.
- Venue
- Science
- Published
- 2016-07-08
- Volume
- 353
- Issue
- 6295
- Pages
- 163-166
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2470861207
- Cited by
- 1,270
- References
- 75
- FWCI
- 57.06
- 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.