Visualization methods for longitudinal social networks and stochastic actor-oriented modeling

Social Networks

Volumn 34, Issue 3, 2012, Pages 291-308

  Brandes, Ulrik ^a   Indlekofer, Natalie ^a   Mader, Martin ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Dynamic network visualization; Longitudinal social networks; Model fit; Stochastic actor oriented models

Indexed keywords

EID: 84861342911     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.socnet.2011.06.002     Document Type: Article

References (63)

1. Bender-deMoll S., McFarland D. The art and science of dynamic network visualization. Journal of Social Structure 2006, 7(2).
2. Bertin J. Semiology of Graphics: Diagrams, Networks, Maps 1983, University of Wisconsin Press.
3. Böhringer K.-F., Paulisch F.N. Using constraints to achieve stability in automatic graph layout algorithms. Proceedings of the ACM Human Factors in Computing Systems Conference (CHI'90) 1990, 43-51. ACM, The Association for Computing Machinery.
4. Brandes U. Drawing on physical analogies. Drawing Graphs: Methods and Models. Vol. 2025 of Lecture Notes in Computer Science 2001, 71-86. Springer-Verlag. M. Kaufmann, D. Wagner (Eds.).
5. Brandes U., Corman S.R. Visual unrolling of network evolution and the analysis of dynamic discourse. Information Visualization 2003, 2(1):40-50.
6. Brandes U., Kenis P., Raab J. Explanation through network visualization. Methodology 2006, 2(1):16-23. Spanish translation in REDES 9(6), 2005.
7. Brandes U., Pich C. Eigensolver methods for progressive multidimensional scaling of large data. Proceedings of the 14th International Symposium on Graph Drawing (GD'06). Vol. 4372 of Lecture Notes in Computer Science 2007, 42-53. Springer-Verlag. M. Kaufmann, D. Wagner (Eds.).
8. Brandes U., Pich C. An experimental study on distance-based graph drawing. Proceedings of the 16th International Symposium on Graph Drawing (GD'08). Vol. 5417 of Lecture Notes in Computer Science 2009, 218-229. Springer-Verlag.
9. Brandes U., Pich C. More flexible radial layout. Journal of Graph Algorithms and Applications 2011, 15(1):157-173.
10. Brandes U., Wagner D. A Bayesian paradigm for dynamic graph layout. Proceedings of the 5th International Symposium on Graph Drawing (GD'97). Vol. 1353 of Lecture Notes in Computer Science 1997, 236-247. Springer-Verlag. G. Di Battista (Ed.).
11. Branke, J., 2001. Dynamic graph drawing. In: Kaufmann and Wagner (2001), pp. 228-246.
12. Bridgeman S.S., Tamassia R. Difference metrics for interactive orthogonal graph drawing algorithms. Journal of Graph Algorithms and Applications 2000, 4(3):47-74.
13. Cleveland W.S., McGill R. Graphical perception: theory, experimentation, and application to the development of graphical methods. Journal of the American Statistical Association 1984, 79(September (387)):531-554.
14. Cox T.F., Cox M.A.A. Multidimensional Scaling 2001, CRC/Chapman and Hall. 2nd edition.
15. de Leeuw J. Applications of convex analysis to multidimensional scaling. Recent Developments in Statistics 1977, 133-145. North-Holland, Amsterdam. J.R. Barra, F. Brodeau, G. Romier, B. van Cutsem (Eds.).
16. Di Battista G., Eades P., Tamassia R., Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs 1999, Prentice Hall.
17. Diehl S., Görg C. Graphs, they are changing. Proceedings of the 10th International Symposium on Graph Drawing (GD'02). Vol. 2528 of Lecture Notes in Computer Science 2002, 23-30. Springer-Verlag.
18. Dwyer T., Gallagher D.R. Visualising changes in fund manager holdings in two and a half-dimensions. Information Visualization 2004, 3(4):227-244.
19. Dwyer T., Hong S.-H., Koschützki D., Schreiber F., Xu K. Visual analysis of network centralities. Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation (APVis'06) 2006, 189-197.
20. Dwyer T., Marriott K., Wybrow M. Topology preserving constrained graph layout. Proceedings of the 16th International Symposium on Graph Drawing (GD'08). Vol. 5417 of Lecture Notes in Computer Science 2008, 230-241. Springer-Verlag.
21. Eades P. A heuristic for graph drawing. Congressus Numerantium 1984, 42:149-160.
22. Erten C., Kobourov S., Le V., Navabi A. Simultaneous graph drawing: layout algorithms and visualization schemes. Proceedings of the 11th International Symposium on Graph Drawing (GD'03). Vol. 2912 of Lecture Notes in Computer Science 2004, 437-449. Springer-Verlag.
23. Freeman, L.C., 2000. Visualizing social networks. Journal of Social Structure 1 (1). http://www.heinz.cmu.edu/project/INSNA/joss/vsn.html.
24. Friedrich C., Eades P. Graph drawing in motion. Journal of Graph Algorithms and Applications 2002, 6(3):353-370.
25. Friedrich C., Houle M.E. Graph drawing in motion II. Proceedings of the 9 International Symposium on Graph Drawing (GD'01). Vol. 2265 of Lecture Notes in Computer Science 2002, 122-125. Springer-Verlag.
26. Frishman Y., Tal A. Online dynamic graph drawing. IEEE Transactions on Visualization and Computer Graphics 2008, 14(4):727-740.
27. Fruchterman T.M., Reingold E.M. Graph-drawing by force-directed placement. Software-Practice and Experience 1991, 21(11):1129-1164.
28. Gajer P., Goodrich M.T., Kobourov S.G. A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry 2004, 29(1):3-18.
29. Gansner E., Hu Y. Efficient node overlap removal using a proximity stress model. Proceedings of the 16th International Symposium on Graph Drawing (GD'08). Vol. 5417 of Lecture Notes in Computer Science 2008, 206-217. Springer-Verlag.
30. Gansner E., Koren Y., North S. Graph drawing by stress majorization. Proceedings of the 12th International Symposium on Graph Drawing (GD'04). Vol. 3383 of Lecture Notes in Computer Science 2004, 239-250. Springer-Verlag.
31. Geipel M.M. Self-organization applied to dynamic network layout. International Journal of Modern Physics C 2007, 18(10):1537-1549.
32. Groh, G., Hanstein, H., Wörndl, W., 2009. Interactively visualizing dynamic social networks with DySoN. In: Proceedings of the IUI'09 Workshop on Visual Interfaces to the Social and Semantic Web (VISSW'09). Vol. 443. CEUR Workshop Proceedings.
33. Hachul S., Jünger M. Drawing large graphs with a potential-field-based multilevel algorithm. Proceedings of the 12th International Symposium on Graph Drawing (GD'04). Vol. 3383 of Lecture Notes in Computer Science 2004, 285-295. Springer-Verlag.
34. Herman I., Melançon G., Marshall M.S. Graph visualization and navigation in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics 2000, 6(1):24-43.
35. Huang M.L., Eades P., Wang J. On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing 1998, 9(6):623-645.
36. Hunter D.R., Goodreau S.M., Handcock M.S. Goodness of fit of social network models. Journal of the American Statistical Association 2008, 103(481):248-258.
37. Kamada T., Kawai S. A simple method for computing general positions in displaying three-dimensional objects. Computer Vision, Graphics and Image Processing 1988, 41:43-56.
38. Drawing Graphs: Methods and Models. Vol. 2025 of Lecture Notes in Computer Science 2001, Springer. M. Kaufmann, D. Wagner (Eds.).
39. Klovdahl A.S. A note on images of networks. Social Networks 1981, 3:197-214.
40. Koskinen J.H., Snijders T.A.B. Bayesian inference for dynamic social network data. Journal of Statistical Planning and Inference 2007, 137(12):3930-3938.
41. Kruskal J., Seery J. Designing network diagrams. Proceedings of the First General Conference on Social Graphics 1980, 22-50.
42. Kruskal J.B., Wish M. Multidimensional Scaling. Vol. 07-011 of Sage University Paper series on Quantitative Applications in the Social Sciences 1978, Sage Publications.
43. Lyons K.A., Meijer H., Rappaport D. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications 1998, 2(1):1-24.
44. Misue K., Eades P., Lai W., Sugiyama K. Layout adjustment and the mental map. Journal on Visual Languages and Computing 1995, 6(2):183-210.
45. Moody J., McFarland D., Bender-deMoll S. Dynamic Network Visualization. American Journal of Sociology 2005, 110(4):1206-1241.
46. Moreno J.L. Who Shall Survive: Foundations of Sociometry, Group Psychotherapy, and Sociodrama 1953, Beacon House.
47. Nesbitt K.V., Friedrich C. Applying gestalt principles to animated visualizations of network data. Proceedings of the 6th International Conference on Information Visualisation (IV'02) 2002, 337-343. IEEE Press.
48. North S.C. Incremental layout with DynaDag. Proceedings of the 3rd International Symposium on Graph Drawing (GD'95). Vol. 1027 of Lecture Notes in Computer Science 1996, 409-418. Springer. F.J. Brandenburg (Ed.).
49. Purchase H.C., Cohen R.F., James M. An experimental study of the basis for graph drawing algorithms. ACM Journal of Experimental Algorithmics 1997, 2(4).
50. Purchase H.C., Samra A. Extremes are better: investigating mental map preservation in dynamic graphs. Proceedings of the 5th International Conference on Diagrammatic Representation and Inference (Diagrams 2008). Vol. 5223 of Lecture Notes in Computer Science 2008, 60-73. Springer-Verlag.
51. Ripley R., Snijders T.A. Manual for Siena Version 4.0 (Version February 6, 2011) 2011, University of Oxford, Department of Statistics; Nuffield College, Oxford, http://www.stats.ox.ac.uk/siena/.
52. Saffrey P., Purchase H. The " mental map" versus " static aesthetic" compromise in dynamic graphs: a user study. Proceedings of the 9th Australasian User Interface Conference (AUIC 2008) 2008, 85-93.
53. Schweinberger, M. (2011). Statistical modelling of network panel data: goodness of fit. British Journal of Mathematical and Statistical Psychology, 64, doi:10.1111/j.2044-8317.2011.02022.x.
54. Sibson R. Studies in the robustness of multidimensional scaling: Procrustes statistics. Journal of the Royal Statistical Society. Series B (Methodological) 1978, 40(2):234-238.
55. Snijders T.A.B. The statistical evaluation of social network dynamics. Sociological Methodology 2001, 31:361-395.
56. Snijders T.A.B. Models for longitudinal network data. Models and Methods in Social Network Analysis 2005, 215-247. Cambridge University Press, New York. P.J. Carrington, J. Scott, S. Wasserman (Eds.).
57. Snijders T.A.B., Koskinen J., Schweinberger M. Maximum likelihood estimation for social network dynamics. Annals of Applied Statistics 2010, 4(2):567-588.
58. Snijders T.A.B., Pattison P.E., Robins G.L., Handcock M.S. New specification for exponential random graph models. Sociological Methodology 2006, 36:99-153.
59. Snijders T.A.B., Steglich C.E.G., Schweinberger M. Modeling the co-evolution of networks and behavior. Longitudinal Models in Behavioral and Related Sciences 2007, 41-71. Lawrence Erlenbaum. K. van Montfort, H. Oud, A. Satorra (Eds.).
60. Snijders T.A.B., van de Bunt G.G., Steglich C.E.G. Introduction to stochastic actor-based models for network dynamics. Social Networks 2010, 32(1):44-60.
61. Steglich C.E.G., Snijders T.A.B., Pearson M. Dynamic networks and behavior: separating selection from influence. Sociological Methodology 2010, 40:329-393.
62. Torgerson W.S. Multidimensional scaling. I. Theory and method. Psychometrika 1952, 17:401-419.
63. Walshaw C. A multilevel algorithm for force-directed graph drawing. Proceedings of the 8th International Symposium on Graph Drawing (GD 2000). Vol. 1984 of Lecture Notes in Computer Science 2001, 171-182. Springer. J. Marks (Ed.).