Definition
SNAP (Small-world Network Analysis and Partitioning) is a framework for exploratory analysis of large-scale complex networks. It provides a collection of optimized parallel implementations for common graph-theoretic problems.
Discussion
Introduction
Graphs are a fundamental abstraction for modeling and analyzing data, and are pervasive in real-world applications. Transportation networks (road and airline traffic), socio-economic interactions (friendship circles, organizational hierarchies, online collaboration networks), and biological systems (food webs, protein interaction networks) are a few examples of data that can be naturally represented as graphs. Understanding the dynamics and evolution of real-world network abstractions is an interdisciplinary research challenge with wide-ranging implications. Empirical studies on networks have led to a variety of models to characterize...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Amaral LAN, Scala A, Barthélémy M, Stanley HE (2000) Classes of small-world networks. Proc Natl Acad Sci USA 97(21): 11149–11152
Bader DA, Madduri K (April 2008) SNAP: Small-world Network Analysis and Partitioning: an open-source parallel graph framework for the exploration of large-scale networks. In: Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), IEEE, Miami, FL
Csárdi G, Nepusz T (2006) The igraph software package for complex network research. InterJournal Complex Systems 1695. http://igraph.sf.net. Accessed May 2011
Fortunato S (Feb 2010) Community detection in graphs. Physics Reports 486(3–5):75–174
Gregor D, Lumsdaine A (July 2005) The Parallel BGL: a generic library for distributed graph computations. In: Proceedings of the Parallel/High-Performance Object-Oriented Scientific Computing (POOSC ’05), IOS Press, Glasgow, UK
Hendrickson B, Leland R (Dec 1995) A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM/IEEE Conference on Supercomputing (SC 1995), ACM/IEEE Computer Society, New York
Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359–392
Madduri K (July 2008) A high-performance framework for analyzing massive complex networks. Ph.D. thesis, Georgia Institute of Technology
Madduri K, Bader DA (May 2009) Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis. In: Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2009), IEEE Computer Society, Rome, Italy
Madduri K, Bader DA, Riedy EJ (2011) SNAP: Small-world Network Analysis and Partitioning v0.4. http://snap-graph.sf.net. Accessed May 2011
Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113
NWB Team (2006) Network Workbench Tool. Indiana University, Northeastern University, and University of Michigan, http://nwb.slis.indiana.edu. Accessed May 2011
Watts DJ, Strogatz SH (1998) Collective dynamics of small world networks. Nature 393:440–442
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Madduri, K. (2011). SNAP (Small-World Network Analysis and Partitioning) Framework. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_94
Download citation
DOI: https://doi.org/10.1007/978-0-387-09766-4_94
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09765-7
Online ISBN: 978-0-387-09766-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering