Analysis and Visualization of Social Networks

Social network analysis is a subdiscipline of the social sciences using graph-theoretic concepts to understand and explain social structure.We describe the main issues in social network analysis. General principles are laid out for visualizing network data in a way that conveys structural information relevant to specific research questions. Based on these innovative graph drawing techniques integrating the analysis and visualization of social networks are introduced.

[1]  Linton C. Freeman,et al.  Visualizing Social Networks , 2000, J. Soc. Struct..

[2]  Steven R. Corman,et al.  Studying Complex Discursive Systems: Centering Resonance Analysis of Communication. , 2002 .

[3]  Jonathan H. Turner,et al.  Toward a Structural Theory of Action: Network Models of Social Structure, Perception and Action.Ronald S. Burt , 1985 .

[4]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[5]  F. Harary,et al.  Eccentricity and centrality in networks , 1995 .

[6]  David Harel,et al.  ACE: a fast multiscale eigenvectors computation for drawing huge graphs , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[7]  Ulrik Brandes,et al.  Fast and Simple Horizontal Coordinate Assignment , 2001, GD.

[8]  Jörg Raab.  Steuerung von Privatisierung , 2002 .

[9]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[10]  U. Brandes,et al.  Explorations into the Visualization of Policy Networks , 1999 .

[11]  U. Brandes,et al.  GraphML Progress Report ? Structural Layer Proposal , 2001 .

[12]  Ulrik Brandes,et al.  Crossing Reduction in Circular Layouts , 2004, WG.

[13]  Béla Bollobás,et al.  Random Graphs , 1985 .

[14]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

[15]  Paul Molitor,et al.  Using Sifting for k -Layer Straightline Crossing Minimization , 1999, GD.

[16]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

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

[18]  J. Anthonisse.  The rush in a directed graph , 1971 .

[19]  Ulrik Brandes,et al.  Communicating Centrality in Policy Network Drawings , 1999, IEEE Trans. Vis. Comput. Graph..

[20]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

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

[22]  T. Valente,et al.  Integration and radiality: Measuring the extent of an individual's connectedness and reachability in a network , 1998 .

[23]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[24]  Alden S. Klovdahl,et al.  A note on images of networks , 1981 .

[25]  Padhraic Smyth,et al.  Analysis and Visualization of Network Data using JUNG , 2005 .

[26]  B. Hayes.  Graph Theory in Practice: Part II , 2000, American Scientist.

[27]  Ioannis G. Tollis,et al.  A Framework for Circular Drawings of Networks , 1999, GD.

[28]  Albert-László Barabási,et al.  Linked: The New Science of Networks , 2002 .

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

[30]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[31]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[32]  Ulrik Brandes,et al.  Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections , 2001, J. Soc. Struct..

[33]  Ioannis G. Tollis,et al.  Circular Drawings of Biconnected Graphs , 1999, ALENEX.

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

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