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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Proceedings of the 23rd international conference on Machine learning
Cohen, W. W., & Moore, A. (2006) · Cited by 2,647
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Self-citationGraphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Self-citationThe dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007) · ACM Transactions on the Web · doi:10.1145/1232722.1232727 · Cited by 2,032
Self-citationLeskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Self-citationStructure and function of the feed-forward loop network motif
Mangan, S., & Alon, U. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2133841100 · Cited by 1,827
Network structure of cerebral cortex shapes functional connectivity on multiple time scales
Honey, C. J., Kötter, R., Breakspear, M., & Sporns, O. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701519104 · Cited by 1,711
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Signed networks in social media
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753532 · Cited by 1,306
Self-citationThe Symmetric Eigenvalue Problem.
Wilkinson, J. H., & Parlett, B. N. (1981) · Mathematics of Computation · doi:10.2307/2007453 · Cited by 1,186
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_2 · Cited by 1,039
Introduction to Information Retrieval
Larson, R. R. (2010) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21234 · Cited by 827
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
Multilevel hypergraph partitioning: applications in VLSI domain
Karypis, G., Aggarwal, R., Kumar, V., & Shekhar, S. (1999) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.748202 · Cited by 800
Sporns, O., & Kötter, R. (2004) · PLoS Biology · doi:10.1371/journal.pbio.0020369 · Cited by 796
FANMOD: a tool for fast network motif detection
Wernicke, S., & Rasche, F. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl038 · Cited by 745
Modeling interactome: scale-free or geometric?
Pržulj, N., Corneil, D. G., & Jurisica, I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth436 · Cited by 706
Interaction strength combinations and the overfishing of a marine food web
Bascompte, J., Melián, C. J., & Sala, E. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0501562102 · Cited by 649
Clustering and Community Detection in Directed Networks: A SurveyPreprint
Malliaros, F. D., & Vazirgiannis, M. (2016) · Cited by 641
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
Kaiser, M., & Hilgetag, C. C. (2006) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0020095 · Cited by 635
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
The Coherent Feedforward Loop Serves as a Sign-sensitive Delay Element in Transcription Networks
Mangan, S., Zaslaver, A., & Alon, U. (2003) · Journal of Molecular Biology · doi:10.1016/j.jmb.2003.09.049 · Cited by 553
Laplacians and the Cheeger Inequality for Directed Graphs
Chung, F. (2005) · Annals of Combinatorics · doi:10.1007/s00026-005-0237-z · Cited by 535
Bascompte, J. (2009) · Science · doi:10.1126/science.1170749 · Cited by 529
Journal of Statistical Mechanics: Theory and Experiment
(2015) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468 · Cited by 514
Proceedings of the 18th international conference on World wide web
(2009) · doi:10.1145/1526709 · Cited by 498
A Method for Detecting Structure in Sociometric Data
Holland, P. W., & Leinhardt, S. (1970) · American Journal of Sociology · doi:10.1086/224954 · Cited by 490
Proceedings of the 13th international conference on World Wide Web
(2004) · doi:10.1145/988672 · Cited by 479
Main-memory triangle computations for very large (sparse (power-law)) graphs
Latapy, M. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.07.017 · Cited by 458
Efficient Detection of Network Motifs
Wernicke, S. (2006) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2006.51 · Cited by 402
Memory in network flows and its effects on spreading dynamics and community detection
Rosvall, M., Esquivel, A. V., Lancichinetti, A., West, J. D., & Lambiotte, R. (2014) · Nature Communications · doi:10.1038/ncomms5630 · Cited by 395
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
Schank, T., & Wagner, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11427186_54 · Cited by 319
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Becchetti, L., Boldi, P., Castillo, C., & Gionis, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401898 · Cited by 319
2011 IEEE 11th International Conference on Data Mining
(2011) · doi:10.1109/icdm19089.2011 · Cited by 305
Gehrke, J., Ginsparg, P., & Kleinberg, J. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/980972.980992 · Cited by 281
Defining and Evaluating Network Communities Based on Ground-Truth
Yang, J., & Leskovec, J. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.138 · Cited by 254
Self-citationRevealing the Hidden Language of Complex Networks
Yaveroğlu, Ö. N., Malod-Dognin, N., Davis, D., Levnajic, Z., Janjic, V., Karapandza, R., Stojmirovic, A., & Pržulj, N. (2014) · Scientific Reports · doi:10.1038/srep04547 · Cited by 247
Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network
Dobrin, R., Beg, Q. K., Barabási, A.-L., & Oltvai, Z. N. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-10 · Cited by 225
Exploiting Social Network Structure for Person-to-Person Sentiment Analysis
West, R., Paskov, H. S., Leskovec, J., & Potts, C. (2014) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00184 · Cited by 198
Self-citationEvidence for the existence of a robust pattern of prey selection in food webs
Stouffer, D. B., Camacho, J., Jiang, W., & Nunes Amaral, L. A. (2007) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2007.0571 · Cited by 188
Nictation, a dispersal behavior of the nematode Caenorhabditis elegans, is regulated by IL2 neurons
Lee, H., Choi, M.-K., Lee, D., Kim, H.-S., Hwang, H., Kim, H., Park, S., Paik, Y.-K., & Lee, J. (2012) · Nature Neuroscience · doi:10.1038/nn.2975 · Cited by 183
Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities
Lee, J. R., Gharan, S. O., & Trevisan, L. (2014) · Journal of the ACM · doi:10.1145/2665063 · Cited by 180
Ross, J. (1992) · Science · doi:10.1126/science.257.5072.860-a · Cited by 178
Proceedings of the 20th international conference on World wide web
(2011) · doi:10.1145/1963405 · Cited by 175
Governance in Social Media: A Case Study of the Wikipedia Promotion Process
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14013 · Cited by 165
Self-citationOverlapping Communities Explain Core–Periphery Organization of Networks
Yang, J., & Leskovec, J. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2364018 · Cited by 159
Self-citationMaschhoff, K., & Sorensen, D. C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-62095-8_51 · Cited by 123
Tensor Spectral Clustering for Partitioning Higher-order Network Structures
Benson, A. R., Gleich, D. F., & Leskovec, J. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.14 · Cited by 114
Self-citationWedge sampling for computing clustering coefficients and triangle counts on large graphs †
Seshadhri, C., Pinar, A., & Kolda, T. G. (2014) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11224 · Cited by 81
Boldi, P., Marino, A., Santini, M., & Vigna, S. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2567948.2577304 · Cited by 80
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
Rodriguez-Velazquez, J. A. (2002) · Linear and Multilinear Algebra · doi:10.1080/03081080290011692 · Cited by 71
Why do simple algorithms for triangle enumeration work in the real world?
Berry, J. W., Fostvedt, L., Nordman, D. J., Phillips, C. A., Seshadhri, C., & Wilson, A. G. (2014) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2554797.2554819 · Cited by 55
Houbraken, M., Demeyer, S., Michoel, T., Audenaert, P., Colle, D., & Pickavet, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0097896 · Cited by 50
Detecting communities of triangles in complex networks using spectral optimization
Serrour, B., Arenas, À., & Gómez, S. (2010) · Computer Communications · doi:10.1016/j.comcom.2010.05.006 · Cited by 43
Demeyer, S., Michoel, T., Fostier, J., Audenaert, P., Pickavet, M., & Demeester, P. M. A. (2013) · PLoS ONE · doi:10.1371/journal.pone.0061183 · Cited by 34
EmptyHeaded: A Relational Engine for Graph ProcessingPreprint
Aberger, C. R., Tu, S., Olukotun, K., & Ré, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.02368 · Cited by 33
Michoel, T., Joshi, A., Nachtergaele, B., & de Peer, Y. V. (2011) · Molecular BioSystems · doi:10.1039/c1mb05241a · Cited by 16
Automatic classification of scientific groups as productive: An approach based on motif analysis
Chakraborty, T., Ganguly, N., & Mukherjee, A. (2014) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2014.6921572 · Cited by 5
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-citation
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.