Fast filtering and animation of large dynamic networks

EPJ Data Science

Volumn 3, Issue 1, 2014, Pages 1-16

  Grabowicz, Przemyslaw A ^a,b   Aiello, Luca Maria ^c   Menczer, Filippo ^d  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITAT DE LES ILLES BALEARS   (Spain)

^c YAHOO RESEARCH   (Spain)

^d INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION DISSEMINATION; OPEN SOURCE SOFTWARE; OPEN SYSTEMS;

DYNAMIC NETWORK; EVOLVING NETWORKS; FAST ALGORITHMS; LARGE DYNAMIC NETWORKS; NETWORK FILTERING; NETWORK VISUALIZATION; SLIDING TIME WINDOWS; WEIGHTED NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 84933513751     PISSN: None     EISSN: 21931127     Source Type: Journal    
DOI: 10.1140/epjds/s13688-014-0027-8     Document Type: Article

References (70)

1. Erten C, Harding P, Kobourov S, Wampler K, Yee G (2004) GraphAEL: graph animations with evolving layouts. In: Liotta G (ed) Graph drawing. Lecture notes in computer science, vol 2912. Springer, Berlin
2. Broeck W, Gioannini C, Goncalves B, Quaggiotto M, Colizza V, Vespignani A (2011) The GLEaMviz computational tool, a publicly available software to explore realistic epidemic spreading scenarios at the global scale. BMC Infect Dis 11:37
3. Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. In: ICWSM’09: proceedings of the international AAAI conference on weblogs and social media. AAAI Press, Menlo Park
4. Dutot A, Guinand F, Olivier D, Pigné Y (2007) GraphStream: a tool for bridging the gap between complex systems and dynamic graphs. In: EPNACS: emergent properties in natural and artificial complex systems
5. Brandes U, Fleischer D, Puppe T (2005) Dynamic spectral layout of small worlds. In: GD’05: proceedings of the 13th international symposium on graph drawing. Springer, Berlin
6. Brandes U, Fleischer D, Puppe T (2007) Dynamic spectral layout with an application to small worlds. J Graph Algorithms Appl 11(2):325-343
7. Brandes U, Indlekofer N, Mader M (2012) Visualization methods for longitudinal social networks and stochastic actor-oriented modeling. Soc Netw 34(3):291-308
8. Kamada T (1989) Visualizing abstract objects and relations. World Scientific, Singapore
9. Tollis IG, Di Battista G, Eades P, Tamassia R (1999) Graph drawing: algorithms for the visualization of graphs. Prentice Hall, New York
10. Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31:7-15
11. Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129-1164. doi:10.1002/spe.4380211102
12. Gansner ER, North SC (1998) Improved force-directed layouts. In: GD’98: proceedings of the 6th international symposium on graph drawing. Springer, London
13. Hu YF (2005) Efficient and high quality force-directed graph drawing. The Mathematica J 10:37-71
14. Herman I, Melançon G, Marshall MS (2000) Graph visualization and navigation in information visualization: a survey. IEEE Trans Vis Comput Graph 6:24-43. doi:10.1109/2945.841119
15. Munzner TM (2000) Interactive visualization of large graphs and networks. PhD thesis, Stanford University, Stanford
16. Batagelj V, Mrvar A (2002) Pajek—analysis and visualization of large networks. In: Mutzel P, Junger M, Leipert S (eds) Graph drawing. Lecture notes in computer science, vol 2265. Springer, Berlin
17. De Nooy W, Mrvar A, Batagelj V (2005) Exploratory social network analysis with Pajek. Cambridge University Press, Cambridge
18. Brandes U, Wagner D (2003) Visone—analysis and visualization of social networks. In: Graph drawing software. Springer, Berlin
19. Adar E (2006) GUESS: a language and interface for graph exploration. In: Proceedings of the SIGCHI conference on human factors in computing systems, CHI’06. ACM, New York
20. Network workbench tool, Indiana University, Northeastern University, and University of Michigan. http://nwb.cns.iu.edu. Accessed 13 Mar 2014
21. Smith MA, Shneiderman B, Milic-Frayling N, Mendes Rodrigues E, Barash V, Dunne C, Capone T, Perer A, Gleave E (2009) Analyzing (social media) networks with NodeXL. In: C&T’09: proceedings of the fourth international conference on communities and technologies. ACM, New York
22. Auber D, Archambault D, Lambert RBA, Mathiaut M, Mary P, Delest M, Dubois J, Melancon G (2012) The tulip 3 framework: a scalable software library for information visualization applications based on relational data. Technical report 7860, INRIA
23. Ahn JW, Taieb-Maimon M, Sopan A, Plaisant C, Shneiderman B (2011) Temporal visualization of social network dynamics: prototypes for nation of neighbors. In: SBP’11: proceedings of the 4th international conference on social computing, behavioral-cultural modeling and prediction. Springer, Berlin 2
24. Heer J, Vizster BD (2005) Visualizing online social networks. In: InfoVis’05: proceedings of the IEEE symposium on information visualization. IEEE Computer Society, Washington
25. Falkowski T, Bartelheimer J, Spiliopoulou M (2006) Mining and visualizing the evolution of subgroups in social networks. In: WI’06: proceedings of the 2006 IEEE/WIC/ACM international conference on web intelligence. IEEE Computer Society, Washington
26. Demetrescu C, Eppstein D, Galil Z, Italiano GF (2010) Dynamic graph algorithms. In: Atallah MJ, Blanton M (eds) Algorithms and theory of computation handbook. Chapman & Hall/CRC, Boca Raton
27. Rosvall M, Bergstrom CT (2010) Mapping change in large networks. PLoS ONE 5:e8694. doi:10.1371/journal.pone.0008694
28. Yi JS, Elmqvist N Lee S (2010) TimeMatrix: analyzing temporal social networks using interactive matrix-based visualizations. Int J Hum-Comput Interact 26:11-12
29. Stein K, Wegener R, Schlieder C (2010) Pixel-oriented visualization of change in social networks. In: ASONAM’10: proceedings of the international conference on advances in social networks analysis and mining. IEEE Computer Society, Washington
30. Gove R, Gramsky N, Kirby R, Sefer E, Sopan A, Dunne C, Shneiderman B, Taieb-Maimon M (2011) NetVisia: heat map & matrix visualization of dynamic social network statistics & content. In: SocialCom’11: proceedings of the 3rd IEEE international conference on social computing. IEEE Computer Society, Washington
31. Farrugia M, Quigley A (2011) Effective temporal graph layout: a comparative study of animation versus static display methods. Inf Vis 10:47-64. doi:10.1057/ivs.2010.10
32. Ramalingam G, Reps T (1996) On the computational complexity of dynamic graph problems. Theor Comput Sci 158:233-277
33. Henzinger MR, King V (1999) Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J ACM 46:502-516
34. Friedrich C, Houle ME (2002) Graph drawing in motion II. In: Mutzel P, Junger M, Leipert S (eds) Graph drawing. Lecture notes in computer science, vol 2265. Springer, Berlin, pp 220-231. doi:10.1007/3-540-45848-4_18
35. Purchase HC (1997) Which aesthetic has the greatest effect on human understanding? In: GD’97: proceedings of the 5th international symposium on graph drawing. Springer, London, pp 248-261. http://dl.acm.org/citation.cfm?id=647549.728779
36. Huang W, Hong SH, Eades P (2006) How people read sociograms: a questionnaire study. In: APVis’06: proceedings of the 2006 Asia-Pacific symposium on information visualisation—volume 60. Australian Computer Society, Darlinghurst, pp 199-206. http://dl.acm.org/citation.cfm?id=1151903.1151932
37. Huang W, Eades P, Hong SH (2008) Beyond time and error: a cognitive approach to the evaluation of graph drawings. In: Proceedings of the 2008 workshop on BEyond time and errors: novel evaLuation methods for Information Visualization, BELIV’08, vol 3. ACM, New York, pp 1-8. http://doi.acm.org/10.1145/1377966.1377970
38. Eades PWL, Misue K, Sugiyama K (1991) Preserving the mental map of a diagram. In: Compugraphics, pp 24-33
39. Misue K, Eades P, Lai W, Sugiyama K (1995) Layout adjustment and the mental map. J Vis Lang Comput 6(2):183-210
40. Freire M, Rodríguez P (2006) Preserving the mental map in interactive graph interfaces. In: AVI’06: proceedings of the working conference on advanced visual interfaces. ACM, New York
41. Coleman MK, Parker DS (1996) Aesthetics-based graph layout for human consumption. Softw Pract Exp 26(12):1415-1438. doi:10.1002/(SICI)1097-024X(199612)26:12<1415::AID-SPE69>3.0.CO;2-P
42. Archambault D, Purchase HC (2013) The “Map” in the mental map: experimental results in dynamic graph drawing. Int J Hum-Comput Stud 71(11):1044-1055. http://www.sciencedirect.com/science/article/pii/S107158191300102X
43. Archambault D, Purchase H (2012) The mental map and memorability in dynamic graphs. In: 2012 IEEE Pacific visualization symposium (PacificVis), pp 89-96
44. Archambault D, Purchase H (2013) Mental map preservation helps user orientation in dynamic graphs. In: Didimo W, Patrignani M (eds) Graph drawing. Lecture notes in computer science, vol 7704. Springer, Berlin, pp 475-486. doi:10.1007/978-3-642-36763-2_42
45. Ghani S, Elmqvist N, Yi JS (2012) Perception of animated node-link diagrams for dynamic graphs. Comput Graph Forum 31(3):1205-1214. doi:10.1111/j.1467-8659.2012.03113.x
46. Archambault D, Munzner T, Auber D (2008) GrouseFlocks: steerable exploration of graph hierarchy space. IEEE Trans Vis Comput Graph 14(4):900-913. doi:10.1109/TVCG.2008.34
47. Kriglstein S, Pohl M, Stachl C (2012) Animation for time-oriented data: an overview of empirical research. In: 16th international conference on information visualisation, pp 30-35
48. North SC (1996) Incremental layout in DynaDAG. In: GD’95: proceedings of the symposium on graph drawing. Springer, London
49. North SC, Woodhull G (2002) Online hierarchical graph drawing. In: GD’01: revised papers from the 9th international symposium on graph drawing. Springer, London
50. Archambault D, Munzner T, Auber D (2007) TopoLayout: multilevel graph layout by topological features. IEEE Trans Vis Comput Graph 13(2):305-317
51. Archambault D (2009) Structural differences between two graphs through hierarchies. In: GI’09: proceedings of graphics interface. Canadian Information Processing Society, Toronto
52. Archambault D, Purchase H, Pinaud B (2010) The readability of path-preserving clusterings of graphs. Comput Graph Forum 29(3):1173-1182. http://hal.inria.fr/inria-00471432
53. Blythe J, McGrath C, Krackhardt D (1996) The effect of graph layout on inference from social network data. In: GD’95: proceedings of the symposium on graph drawing. Springer, London, pp 40-51. http://dl.acm.org/citation.cfm?id=647547.728581
54. Brandes U (2001) Drawing on physical analogies. In: Kaufmann M, Wagner D (eds) Drawing graphs. Springer, London
55. Branke J (2001) Dynamic graph drawing. In: Kaufmann M, Wagner D (eds) Drawing graphs. Springer, London
56. Diehl S, Gorg C (2002) Graphs, they are changing. In: Goodrich M, Kobourov S (eds) Graph drawing. Lecture notes in computer science, vol 2528. Springer, Berlin
57. Frishman Y, Tal A (2008) Online dynamic graph drawing. IEEE Trans Vis Comput Graph 14:727-740
58. Rodrigues EM, Milic-Frayling N, Smith M, Shneiderman B, Hansen D (2011) Group-in-a-box layout for multi-faceted analysis of communities. In: SocialCom’11: proceedings of the 3rd IEEE international conference on social computing. IEEE Computer Society, Washington
59. Dynes SBC, Gloor PA, Gloor PA, Gloor PA, Laubacher R, Laubacher R, Zhao Y, Zhao Y, Dynes S (2004) Temporal visualization and analysis of social networks. In: NAACSOS’04: conference of North American Association for Computational Social and Organizational Science
60. Kumar G, Garland M (2006) Visual exploration of complex time-varying graphs. IEEE Trans Vis Comput Graph 12:805-812
61. Hadlak S, Schulz HJ, Schumann H (2011) In situ exploration of large dynamic networks. IEEE Trans Vis Comput Graph 17(12):2334-2343. http://dblp.uni-trier.de/db/journals/tvcg/tvcg17.html#HadlakSS11
62. Sallaberry A, Muelder C, Ma KL (2013) Clustering, visualizing, and navigating for large dynamic graphs. In: GD’12: proceedings of the 20th international conference on graph drawing. Springer, Berlin, pp 487-498. http://dx.doi.org/10.1007/978-3-642-36763-2_43
63. Asur S, Parthasarathy S, Ucar D (2007) An event-based framework for characterizing the evolutionary behavior of interaction graphs. In: KDD’07: proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York
64. Clauset AEN (2007) Persistence and periodicity in a dynamic proximity network. In: DIMACS workshop on computational methods for dynamic interaction networks
65. Cattuto C, Van den Broeck W, Barrat A, Colizza V, Pinton JF, Vespignani A (2010) Dynamics of person-to-person interactions from distributed RFID sensor networks. PLoS ONE 5(7):e11596. doi:10.1371/journal.pone.0011596
66. Krings G, Karsai M, Bernhardsson S, Blondel V, Saramaki J (2012) Effects of time window size and placement on the structure of an aggregated communication network. EPJ Data Sci 1:4. http://www.epjdatascience.com/content/1/1/4
67. Lotan G (2011) Breaking bin Laden: a closer look. http://blog.socialflow.com/post/5454638896/breaking-bin-laden-a-closer-look. Accessed 13 Mar 2014
68. LaRowe G, Ambre S, Burgoon J, Ke W, Börner K (2009) The scholarly database and its utility for scientometrics research. Scientometrics 79(2):219-234
69. Graph Streaming API documentation. http://wiki.gephi.org/index.php/Specification_-_GSoC_Graph_Streaming_API. Accessed 13 Mar 2014
70. Mencoder tool documentation. http://www.mplayerhq.hu/design7/documentation.html. Accessed 13 Mar 2014