Large-Scale Social Network Analysis

Social Network Analysis (SNA) is an established discipline for the study of groups of individuals with applications in several areas, like economics, information science, organizational studies and psychology. In the last fifteen years the exponential growth of online Social Network Sites (SNSs) , like Facebook, QQ and Twitter has provided a new challenging application context for SNA methods. However, with respect to traditional SNA application domains these systems are characterized by very large volumes of data, and this has recently led to the development of parallel network analysis algorithms and libraries. In this chapter we provide an overview of the state of the art in the field of large scale social network analysis; in particular, we focus on parallel algorithms and libraries for the computation of network centrality metrics.

[1]  Fabio Celli,et al.  Social Network Data and Practices: The Case of Friendfeed , 2010, SBP.

[2]  David A. Bader,et al.  SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[3]  Henri E. Bal,et al.  A High-Level Framework for Distributed Processing of Large-Scale Graphs , 2011, ICDCN.

[4]  Nitesh V. Chawla,et al.  DisNet: A Framework for Distributed Graph Computation , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[5]  Anoop Gupta,et al.  Parallel computer architecture - a hardware / software approach , 1998 .

[6]  Douglas P. Gregor,et al.  The Parallel BGL : A Generic Library for Distributed Graph Computations , 2005 .

[7]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[8]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[9]  T. Kielmann,et al.  Real-world Distributed Computing with Ibis , 2010 .

[10]  Sandeep Koranne,et al.  Boost C++ Libraries , 2011 .

[11]  Jonathan W. Berry,et al.  Challenges in Parallel Graph Processing , 2007, Parallel Process. Lett..

[12]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[13]  Klaus Iglberger,et al.  Parallel Computing. Numerics, Applications, and Trends , 2009 .

[14]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[15]  Matteo Magnani,et al.  The ML-Model for Multi-layer Social Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[16]  Torsten Hoefler,et al.  A space-efficient parallel algorithm for computing betweenness centrality in distributed memory , 2010, 2010 International Conference on High Performance Computing.

[17]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[18]  Henri E. Bal,et al.  HipG: parallel processing of large-scale graphs , 2011, OPSR.

[19]  Charles L. Lawson,et al.  Basic Linear Algebra Subprograms for Fortran Usage , 1979, TOMS.

[20]  James Demmel,et al.  the Parallel Computing Landscape , 2022 .

[21]  Qi He,et al.  TwitterRank: finding topic-sensitive influential twitterers , 2010, WSDM '10.

[22]  David A. Bader,et al.  Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[23]  John R. Gilbert,et al.  The Combinatorial BLAS: design, implementation, and applications , 2011, Int. J. High Perform. Comput. Appl..

[24]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[25]  Jim Law,et al.  Review of "The boost graph library: user guide and reference manual by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine." Addison-Wesley 2002. , 2003, SOEN.

[26]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[27]  S. Borgatti,et al.  Betweenness centrality measures for directed graphs , 1994 .

[28]  Jason Maassen,et al.  Real-World Distributed Computer with Ibis , 2010, Computer.

[29]  Hao Wang,et al.  Analysis of Large Multi-modal Social Networks: Patterns and a Generator , 2010, ECML/PKDD.

[30]  Roman Trobec,et al.  Overview – Parallel Computing: Numerics, Applications, and Trends , 2009 .

[31]  Michael Mikolajczak,et al.  Designing And Building Parallel Programs: Concepts And Tools For Parallel Software Engineering , 1997, IEEE Concurrency.

[32]  David A. Bader,et al.  Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[33]  David A. Bader,et al.  Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[34]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[35]  Matteo Magnani,et al.  Information Propagation Analysis in a Social Network Site , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[36]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[37]  Cecilia R. Aragon,et al.  Randomized search trees , 2005, Algorithmica.

[38]  Daniel J. Duffy.  The Boost C++ Libraries: Part II , 2011 .

[39]  Douglas Thain,et al.  Qthreads: An API for programming with millions of lightweight threads , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[40]  Christos Faloutsos,et al.  PEGASUS: mining peta-scale graphs , 2011, Knowledge and Information Systems.

[41]  Sanjay Ghemawat,et al.  MapReduce: a flexible data processing tool , 2010, CACM.

[42]  M. Lanzagorta,et al.  Early Experience with Scientific Programs on the Cray MTA-2 , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[43]  Ed H. Chi,et al.  Towards a model of understanding social search , 2008, SSM '08.

[44]  Shekhar Y. Borkar,et al.  Design challenges of technology scaling , 1999, IEEE Micro.

[45]  Giovanni Dietler,et al.  Knotted Fishing Line, Covalent Bonds, and Breaking Points , 1999 .

[46]  Brian W. Barrett,et al.  Implementing a portable Multi-threaded Graph Library: The MTGL on Qthreads , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.