Effective and Efficient Methodologies for Social Network Analysis

Performing social network analysis (SNA) requires a set of powerful techniques to analyze structural information contained in interactions between social entities. Many SNA technologies and methodologies have been developed and have successfully provided significant insights for small-scale interactions. However, these techniques are not suitable for analyzing large social networks, which are very popular and important in various fields and have special structural properties that cannot be obtained from small networks or their analyses. There are a number of issues that need to be further studied in the design of current SNA techniques. A number of key issues can be embodied in three fundamental and critical challenges: long processing time, large computational resource requirements, and network dynamism. In order to address these challenges, we discuss an anytime-anywhere methodology based on a parallel/distributed computational framework to effectively and efficiently analyze large and dynamic social networks. In our methodology, large social networks are decomposed into intra-related smaller parts. A coarse-level of network analysis is built based on comprehensively analyzing each part. The partial analysis results are incrementally refined over time. Also, during the analyses process, network dynamic changes are effectively and efficiently adapted based on the obtained results. In order to evaluate and validate our methodology, we implement our methodology for a set of SNA metrics which are significant for SNA applications and cover a wide range of difficulties. Through rigorous theoretical and experimental analyses, we

[1]  Stephen J. Ressler Social Network Analysis as an Approach to Combat Terrorism: Past, Present, and Future Research , 2006 .

[2]  Eugene Santos,et al.  Solving Hard Computational Problems through Collections (Portfolios) of Cooperative Heterogeneous Algorithms , 1999, FLAIRS Conference.

[3]  Mark E. J. Newman A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[4]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[5]  Akira Tanaka,et al.  The Worst-Case Time Complexity for Generating All Maximal Cliques , 2004, COCOON.

[6]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[7]  Nagiza F. Samatova,et al.  Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[8]  William Kramer,et al.  Proceedings of the 2005 ACM/IEEE conference on Supercomputing , 2005 .

[9]  Ove Frank Using centrality modeling in network surveys , 2002, Soc. Networks.

[10]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[11]  Peter V. Marsden,et al.  Egocentric and sociocentric measures of network centrality , 2002, Soc. Networks.

[12]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[13]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[14]  S. Redner How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[17]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[18]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[19]  Vladimir Batagelj,et al.  Exploratory Social Network Analysis with Pajek , 2005 .

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

[21]  Uri Zwick,et al.  A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths , 2004, ISAAC.

[22]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[23]  Vladimir Batagelj,et al.  Centrality in Social Networks , 1993 .

[24]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[25]  Michael T. Goodrich,et al.  Algorithm Design: Foundations, Analysis, and Internet Examples , 2001 .

[26]  Thomas Linke,et al.  Visualizing plant metabolomic correlation networks using clique-metabolite matrices , 2001, Bioinform..

[27]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[28]  Mark E. J. Newman,et al.  Ego-centered networks and the ripple effect , 2001, Soc. Networks.

[29]  B. Wellman The Development of Social Network Analysis: A Study in the Sociology of Science , 2008 .

[30]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[31]  S. Strogatz Exploring complex networks , 2001, Nature.

[32]  H. C. Johnston Cliques of a graph-variations on the Bron-Kerbosch algorithm , 2004, International Journal of Computer & Information Sciences.

[33]  Yijie Han,et al.  Efficient parallel algorithms for computing all pair shortest paths in directed graphs , 1992, SPAA '92.

[34]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[35]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[36]  Michael L. Fredman,et al.  New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[37]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[38]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[39]  Mark Newman,et al.  Models of the Small World , 2000 .

[40]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[41]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[42]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[43]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[44]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[45]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[46]  S. Wasserman,et al.  Models and Methods in Social Network Analysis , 2005 .

[47]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[48]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[50]  Chris Walshaw,et al.  A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning , 2004, J. Glob. Optim..

[51]  Dustin Arendt,et al.  An Effective Anytime Anywhere Parallel Approach for Centrality Measurements in Social Network Analysis , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[52]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[53]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[54]  Ali Kaveh,et al.  A hybrid graph-genetic method for domain decomposition , 2000 .

[55]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[56]  Lada A. Adamic The Small World Web , 1999, ECDL.

[57]  Michael J. Quinn,et al.  Parallel programming in C with MPI and OpenMP , 2003 .

[58]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[59]  L. Freeman,et al.  The Development of Social Network Analysis: A Study in the Sociology of Science , 2005 .

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

[61]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[62]  A. Fronczak,et al.  Higher order clustering coefficients in Barabási–Albert networks , 2002, cond-mat/0212237.

[63]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[64]  Charles Kadushin,et al.  Who benefits from network analysis: ethics of social network research , 2005, Soc. Networks.

[65]  Eugene Santos A Computational Model for Portfolios of Cooperative Heterogeneous Algorithms for Discrete Optimization , 2001, FLAIRS Conference.

[66]  P. V. Marsden,et al.  NETWORK DATA AND MEASUREMENT , 1990 .

[67]  Yijie Han,et al.  Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs , 1992, SPAA.

[68]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[69]  A. Gibbons Algorithmic Graph Theory , 1985 .

[70]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[71]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.