Introduction
Networks are pervasive in today’s world. They provide appropriate representations for systems comprised of individual agents interacting locally. Examples of such systems are urban regional transportation systems, national electrical power markets and grids, the Internet, ad-hoc communication and computing systems, public health, etc. According to Wikipedia, A social network is a social structure made of individuals (or organizations) called “nodes,” which are tied (connected) by one or more specific types of interdependency, such as friendship, kinship, financial exchange, dislike, sexual relationships, or relationships of beliefs, knowledge or prestige. Formally, a social network induced by a set V of agents is a graph G = (V, E), with an edge e = (u, v) ∈ E between individuals u and v, if they are interrelated or interdependent. Here, we use a more general definition of nodes and edges (that represent interdependency). The nodes represent living or virtual individuals....
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Apache hadoop. Code and documentation are available at http://developer.yahoo.com/hadoop/
Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512
Barrett C, Bisset K, Marathe A, Marathe M (2009) An integrated modeling environment to study the co-evolution of networks, individual behavior and epidemics. AI Magazine, 2009
Barrett C, Eubuank S, Marathe M (2005) Modeling and simulation of large biological, information and socio-technical systems: an interaction based approach interactive computation. In: Goldin D, Smolka S, Wegner P (2005) The new paradigm, Springer, Berlin, Heidelberg, New York
Baur M, Brandes U, Lerner J, Wagner D (2009), Group-level analysis and visualization of social networks. In: Lerner J, Wagner D, Zweig K (eds) Algorithmics of large and complex networks, vol 5515, LNCS. Springer, Berlin, Heidelberg, New York, pp 330–358
Dean J, Ghemawat S (2004) Mapreduce: Simplified data processing on large clusters. In: Proceedings of the sixth symposium on operating system design and implementation (OSDI), San Francisco, December 2004
Eubank S, Guclu H, Anil Kumar VS, Marathe MV, Srinivasan A, Toroczkai Z, Wang N (2004) Modelling disease outbreaks in realistic urban social networks. Nature 429(6998):180–184
Feldman J, Muthukrishnan S, Sidiropoulos A, Stein C, Svitkina Z (2008) On distributing symmetric streaming computations. In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), San Francisco, pp 710–719
Freeman L (2004) The development of social network analysis: a study in the sociology of science. Empirical Press, Vancouver
Granovetter M (1978) Threshold models of collective behavior. Am J Sociològy 83(6):1420–1443
Grimmett G (1999) Percolation. Springer, New York
Hendrickson B, Berry J (2008) Graph analysis with high-performance computing. Comput Sci Eng 10:14–19
Kang U, Tsourakakis CE, Appel AP, Faloutsos C, Leskovec J (2008) Hadi: fast diameter estimation and mining in massive graphs with hadoop. Technical Report CMU-ML-08-117, Carnegie Mellon University
Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. In: SIGKDD ‘03, Washington
Lumsdaine A, Gregor D, Hendrickson B, Berry J (2007) Challenges in parallel graph processing. Parallel Process Lett 17:5–20
Madduri K, Ediger D, Jiang K, Bader DA, Chavarra-Miranda DG (2009) A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In: Proceedings of the 3rd Workshop on Multithreaded Architectures and Applications (MTAAP), Miami, May 2009
Mortveit HS, Reidys CM (2000) Discrete sequential dynamical systems. Discrete Math 226:281–295
National Research Council of the National Academies (2005) Network Science. The National Academies Press, Washington, DC
Newman M (2003) The structure and function of complex networks. SIAM Rev 45:167–256
Newman MEJ (2004) Detecting community structure in networks. European Phy J B, 38:321–330
Special issue on complex systems and networks, Science, 24 July 2009, 325 (5939):357–504
Travers J, Milgram S (1969) An experimental study of the small world problem. Sociometry 32(4):425–443
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
Khan, M., Kumar, V.S.A., Marathe, M.V., Stretz, P.E. (2011). Social Networks. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_163
Download citation
DOI: https://doi.org/10.1007/978-0-387-09766-4_163
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