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
关键词
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
相关论文
共 50 条
  • [1] Minimum spanning trees on random networks
    Dobrin, R
    Duxbury, PM
    PHYSICAL REVIEW LETTERS, 2001, 86 (22) : 5076 - 5079
  • [2] Minimum spanning trees in networks with varying edge weights
    Kevin R. Hutson
    Douglas R. Shier
    Annals of Operations Research, 2006, 146 : 3 - 18
  • [3] Minimum spanning trees in networks with varying edge weights
    Hutson, Kevin R.
    Shier, Douglas R.
    ANNALS OF OPERATIONS RESEARCH, 2006, 146 (1) : 3 - 18
  • [4] The trees and the forest: Characterization of complex brain networks with minimum spanning trees
    Stam, C. J.
    Tewarie, P.
    Van Dellen, E.
    van Straaten, E. C. W.
    Hillebrand, A.
    Van Mieghem, P.
    INTERNATIONAL JOURNAL OF PSYCHOPHYSIOLOGY, 2014, 92 (03) : 129 - 138
  • [5] Minimum spanning trees of weighted scale-free networks
    Macdonald, PJ
    Almaas, E
    Barabási, AL
    EUROPHYSICS LETTERS, 2005, 72 (02): : 308 - 314
  • [6] Geometry of minimum spanning trees on scale-free networks
    Szabó, GJ
    Alava, M
    Kertész, J
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 330 (1-2) : 31 - 36
  • [7] AN EVOLUTIONARY MODEL FOR EFFICIENT TRANSPORTATION NETWORKS BASED ON MINIMUM SPANNING TREES
    Huang, Ian
    Chen, Mei
    Yang, William
    Qin, Zengchang
    2015 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS IHMSC 2015, VOL I, 2015, : 255 - 259
  • [8] Identification of Dementia Related Brain Functional Networks with Minimum Spanning Trees
    Adebisi, Abdulyekeen T.
    Gonuguntla, Venkateswarlu
    Lee, Ho-Won
    Veluvolu, Kalyana C.
    2020 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE, 2020, : 1761 - 1768
  • [9] HAMSTER: visualizing microarray experiments as a set of minimum spanning trees
    Wan, Raymond
    Kiseleva, Larisa
    Harada, Hajime
    Mamitsuka, Hiroshi
    Horton, Paul
    SOURCE CODE FOR BIOLOGY AND MEDICINE, 2009, 4 (01):
  • [10] Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
    Khan, Maleq
    Pandurangan, Gopal
    Kumar, V. S. Anil
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (01) : 124 - 139