The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
SNAP: A General-Purpose Network Analysis and Graph-Mining Library
Open accessAbstract
Large networks are becoming a widely used abstraction for studying complex systems in a broad set of disciplines, ranging from social-network analysis to molecular biology and neuroscience. Despite an increasing need to analyze and manipulate large networks, only a limited number of tools are available for this task. Here, we describe the Stanford Network Analysis Platform (SNAP), a general-purpose, high-performance system that provides easy-to-use, high-level operations for analysis and manipulation of large networks. We present SNAP functionality, describe its implementational details, and give performance benchmarks. SNAP has been developed for single big-memory machines, and it balances the trade-off between maximum performance, compact in-memory graph representation, and the ability to handle dynamic graphs in which nodes and edges are being added or removed over time. SNAP can process massive networks with hundreds of millions of nodes and billions of edges. SNAP offers over 140 different graph algorithms that can efficiently manipulate large graphs, calculate structural properties, generate regular and random graphs, and handle attributes and metadata on nodes and edges. Besides being able to handle large graphs, an additional strength of SNAP is that networks and their attributes are fully dynamic; they can be modified during the computation at low cost. SNAP is provided as an open-source library in C++ as well as a module in Python. We also describe the Stanford Large Network Dataset, a set of social and information real-world networks and datasets, which we make publicly available. The collection is a complementary resource to our SNAP software and is widely used for development and benchmarking of graph analytics algorithms.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
(1999) · Cited by 12,854
The igraph software package for complex network research
Csárdi, G., & Nepusz, T. (2006) · Medical Entomology and Zoology · Cited by 10,078
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
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Jackson, M. O. (2010) · Princeton University Press eBooks · doi:10.2307/j.ctvcm4gh1 · Cited by 3,606
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Jackson, M. O. (2008) · Princeton University Press eBooks · doi:10.1515/9781400833993 · Cited by 2,666
International Conference on Machine Learning (ICML)-2005
津田, 宏. (2006) · 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence · Cited by 2,558
Learning to Discover Social Circles in Ego Networks
Leskovec, J., & McAuley, J. (2012) · neural information processing systems · Cited by 2,492
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-citationHierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Meme-tracking and the dynamics of the news cycle
Leskovec, J., Backstrom, L., & Kleinberg, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557077 · Cited by 1,530
Self-citationPowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Networks, Crowds, and Markets: Network Dynamics: Structural Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Networks, Crowds, and Markets: Network Dynamics: Population Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Pajek - Program for Large Network Analysis
Batagelj, V., & Mrvar, A. (1999) · Cited by 1,414
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
Overlapping community detection at scale: a nonnegative matrix factorization approach
Yang, J., & Leskovec, J. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433471 · Cited by 852
Self-citation4 Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · Cited by 803
Self-citationKronecker Graphs: An Approach to Modeling Networks
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 697
Self-citationInferring networks of diffusion and influence
Gomez Rodriguez, M., Leskovec, J., & Krause, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835933 · Cited by 679
Self-citationStochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Xin, R., Gonzalez, J. E., Franklin, M. J. M., & Stoica, I. G. (2013) · doi:10.1145/2484425.2484427 · Cited by 581
GPS: a graph processing system
Salihoglu, S., & Widom, J. (2013) · Proceedings of the 25th International Conference on Scientific and Statistical Database Management · doi:10.1145/2484838.2484843 · Cited by 510
Kronecker Graphs: An Approach to Modeling Networks
LeskovecJure, ChakrabartiDeepayan, KleinbergJon, FaloutsosChristos, & GhahramaniZoubin (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1756039 · Cited by 470
Inferring Networks of Diffusion and Influence
Gomez-Rodriguez, M., Leskovec, J., & Krause, A. (2012) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2086737.2086741 · Cited by 445
Self-citation2018 IEEE International Conference on Data Mining (ICDM)
(2018) · doi:10.1109/icdm44384.2018 · Cited by 444
Discovering social circles in ego networks
Mcauley, J., & Leskovec, J. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2556612 · Cited by 366
Self-citationCommunity-Affiliation Graph Model for Overlapping Network Community Detection
Yang, J., & Leskovec, J. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.139 · Cited by 293
Self-citationOn the uniform generation of random graphs with prescribed degree sequences
Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J., & Alon, U. (2003) · arXiv · doi:10.48550/arxiv.cond-mat/0312028 · Cited by 281
Analysis and Visualization of Network Data using JUNG
O’Madadhain, J., Fisher, D., Smyth, P., & Boey, Y.-B. (2005) · Cited by 275
Structure and dynamics of information pathways in online media
Gomez Rodriguez, M., Leskovec, J., & Schölkopf, B. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433402 · Cited by 271
Self-citationNetwork Lasso: Clustering and Optimization in Large Graphs
Hallac, D., Leskovec, J., & Boyd, S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783313 · Cited by 235
Self-citationThe Network Completion Problem: Inferring Missing Nodes and Edges in Networks
Kim, M., & Leskovec, J. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.5 · Cited by 217
Self-citationGeneralized CoresPreprint
Batagelj, V., & Zaveršnik, M. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0202039 · Cited by 199
SpamRank -- Fully Automatic Link Spam Detection.
Benczúr, A. A., Csalogány, K., Sarlós, T., & Uher, M. (2005) · Cited by 170
Overlapping 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-citationMultiplicative Attribute Graph Model of Real-World Networks
Kim, M., & Leskovec, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-18009-5_7 · Cited by 155
Self-citationUncovering the structure and temporal dynamics of information propagation
Gomez-Rodriguez, M., Leskovec, J., Balduzzi, D., & Schölkopf, B. (2014) · Network Science · doi:10.1017/nws.2014.3 · Cited by 145
Self-citationThe Conference on Uncertainty in Artificial Intelligence (UAI 2017)
Belle, V. (2017) · Cited by 139
PATRIC: a parallel algorithm for counting triangles in massive networks
Arifuzzaman, S., Khan, M., & MARATHE, M. V. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505545 · Cited by 126
Personalized PageRank Estimation and Search
Lofgren, P., Banerjee, S., & Goel, A. (2016) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2835776.2835823 · Cited by 125
Multiplicative Attribute Graph Model of Real-World Networks
Kim, M., & Leskovec, J. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.625257 · Cited by 110
Self-citationA Geometric Preferential Attachment Model of Networks
Flaxman, A. D., FRIEZE, A. M., & Vera, J. C. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129124 · Cited by 102
Lofgren, P., Banerjee, S., Goel, A., & Seshadhri, C. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623745 · Cited by 101
Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph ModelPreprint
Kim, M., & Leskovec, J. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.5053 · Cited by 90
Self-citationDetecting cohesive and 2-mode communities indirected and undirected networks
Yang, J., McAuley, J., & Leskovec, J. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556243 · Cited by 71
Self-citationKim, J., Han, W.-S., Lee, S., Park, K., & Yu, H. (2014) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2588555.2588563 · Cited by 66
Analysis of Robust Quasi-Deviances for Generalized Linear Models
Cantoni, E. (2004) · Journal of Statistical Software · doi:10.18637/jss.v010.i04 · Cited by 60
Latent Multi-group Membership Graph ModelPreprint
Kim, M., & Leskovec, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.4546 · Cited by 51
Self-citationNIFTY: a system for large scale information flow tracking and clustering
Suen, C., Huang, S., Eksombatchai, C., Sosič, R., & Leskovec, J. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488496 · Cited by 39
Self-citationDetecting Cohesive and 2-mode Communities in Directed and Undirected NetworksPreprint
Yang, J., McAuley, J., & Leskovec, J. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.7375 · Cited by 34
Self-citation
Research works printed but not linked: 9
- D. Easley and J. Kleinberg. 2010. Networks Crowds and Markets: Reasoning About a Highly Connected World. Cambridge University Press. · doi:10.5555/1805895
- D. Gregor and A. Lumsdaine. 2005. The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC) 2 (2005), 1--18.
- 10.5555/1571644 · doi:10.5555/1571644
- M. Kim and J. Leskovec. 2013. Nonparametric multi-group membership model for dynamic networks. In Advances in Neural Information Processing Systems (NIPS). 1385--1393.
- 10.5555/795666.796570 · doi:10.5555/795666.796570
- 10.5555/2387880.2387884 · doi:10.5555/2387880.2387884
- 10.1109/TCSS.2014.2377789 · DOI
- M. Newman. 2010. Networks: An Introduction. OUP Oxford. · doi:10.5555/1809753
- 10.1145/2723372.2735369 · doi:10.1145/2723372.2735369
Cited by
Edge Weight Prediction in Weighted Signed Networks
Kumar, S., Spezzano, F., Subrahmanian, V. S., & Faloutsos, C. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0033 · Cited by 498
Open Graph Benchmark: Datasets for Machine Learning on Graphs
Hu, W., Fey, M., Žitnik, M., Dong, Y., Ren, H., Liu, B., Catasta, M., & Leskovec, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.00687 · Cited by 470
Self-citationA super pan-genomic landscape of rice
Shang, L., Li, X., He, H., Yuan, Q., Song, Y., Wei, Z., Lin, H., Hu, M., Zhao, F., Zhang, C., et al. (2022) · Cell Research · doi:10.1038/s41422-022-00685-z · Cited by 369
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
A Guide to Conquer the Biological Network Era Using Graph Theory
Koutrouli, M., Karatzas, E., Paez-Espino, D., & Pavlopoulos, G. A. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00034 · Cited by 264
Metadata
- Authors
- Leskovec, J., & Sosič, R.
- Venue
- ACM Transactions on Intelligent Systems and Technology
- Published
- 2016-07-15
- Volume
- 8
- Issue
- 1
- Pages
- 1-20
- ISSN
- 2157-6904 (ISSN-L)
- 2157-6912
- OpenAlex
- W2469279958
- Cited by
- 870
- References
- 58
- FWCI
- 62.30
- Type
- journal article
- Language
- en
- Open access
- bronze
- Funders
- NSF (IIS-1016909,CNS-1010921,IIS-1149837)
- Defense Advanced Research Projects Agency (SIMPLEX, XDATA)
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.