DocumentCode
2339384
Title
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
Author
Chen, Chaomei ; Morris, Steven
Author_Institution
Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA
fYear
2003
fDate
21-21 Oct. 2003
Firstpage
67
Lastpage
74
Abstract
Network evolution is an ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such as small-world networks and scale-free networks. In this article, we address a practical issue concerning the visualizations of co-citation networks of scientific publications derived by two widely known link reduction algorithms, namely minimum spanning trees (MSTs) and pathfinder networks (PFNETs). Our primary goal is to identify the strengths and weaknesses of the two methods in fulfilling the need for visualizing evolving networks. Two criteria are derived for assessing visualizations of evolving networks in terms of topological properties and dynamical properties. We examine the animated visualization models of the evolution of botulinum toxin research in terms of its co-citation structure across a 58-year span (1945-2002). The results suggest that although high-degree nodes dominate the structure of MST models, such structures can be inadequate in depicting the essence of how the network evolves because MST removes potentially significant links from high-order shortest paths. In contrast, PFNET models clearly demonstrate their superiority in maintaining the cohesiveness of some of the most pivotal paths, which in turn make the growth animation more predictable and interpretable. We suggest that the design of visualization and modeling tools for network evolution should take the cohesiveness of critical paths into account.
Keywords
citation analysis; data visualisation; solid modelling; trees (mathematics); MST; PFNET; botulinum toxin research; cocitation networks; complex networks; dynamical properties; evolving network visualization; growth animation; high-degree nodes; link reduction algorithms; minimum spanning trees; network evolution; pathfinder networks; scale-free networks; scientific publications; shortest paths; small-world networks; topological properties; ubiquitous computing; visualization assessment; Animation; Chaos; Citation analysis; Complex networks; Computer graphics; Computer networks; Data visualization; Educational institutions; Information science; Pervasive computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Visualization, 2003. INFOVIS 2003. IEEE Symposium on
Conference_Location
Seattle, WA, USA
Print_ISBN
0-7803-8154-8
Type
conf
DOI
10.1109/INFVIS.2003.1249010
Filename
1249010
Link To Document