Visualizing evolving networks: Minimum spanning trees versus Pathfinder networks

被引:137
作者
Chen, CM [1 ]
Morris, S [1 ]
机构
[1] Drexel Univ, Coll Informat Sci & Technol, Philadelphia, PA 19104 USA
来源
INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2003, PROCEEDINGS | 2003年
关键词
network evolution; network visualization; co-citation networks; Pathfinder networks; minimum spanning trees;
D O I
10.1109/INFVIS.2003.1249010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network evolution is a 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 visualization of network evolution. We compare 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 primarily 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.
引用
收藏
页码:67 / 74
页数:8
相关论文
共 45 条
  • [1] Requirements for a cocitation similarity measure, with special reference to Pearson's correlation coefficient
    Ahlgren, P
    Jarneving, B
    Rousseau, R
    [J]. JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2003, 54 (06): : 550 - 560
  • [2] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [3] AN Y, 2001, CS200102 DALH U
  • [4] [Anonymous], 1990, PATHFINDER ASS NETWO
  • [5] Scale-free characteristics of random networks:: the topology of the World-Wide Web
    Barabási, AL
    Albert, R
    Jeong, H
    [J]. PHYSICA A, 2000, 281 (1-4): : 69 - 77
  • [6] Evolution of the social network of scientific collaborations
    Barabási, AL
    Jeong, H
    Néda, Z
    Ravasz, E
    Schubert, A
    Vicsek, T
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2002, 311 (3-4) : 590 - 614
  • [7] BATAGELJ V, 2001, LAYOUTS GD01 GRAPH D
  • [8] Visual unrolling of network evolution and the analysis of dynamic discourse
    Brandes, U
    Corman, SR
    [J]. INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2002, 2002, : 145 - 151
  • [9] Brandes U., 2002, Data Visualisation (VISSYM), P159
  • [10] BRANIGAN S, 1999, EFFECTS WAR YUGOSLAV