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 条
  • [21] Completely independent spanning trees in torus networks
    Hasunuma, Toru
    Morisaka, Chie
    NETWORKS, 2012, 60 (01) : 59 - 69
  • [22] Independent spanning trees in Eisenstein–Jacobi networks
    Zaid Hussain
    Hosam AboElFotoh
    Bader AlBdaiwi
    The Journal of Supercomputing, 2022, 78 : 12114 - 12135
  • [23] Constructing Independent Spanning Trees on Transposition Networks
    Lin, Chien-Fu
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    IEEE ACCESS, 2020, 8 : 147122 - 147132
  • [24] A Minimum Spanning Tree Problem in Uncertain Networks
    He, FangGuo
    Shao, GuiMing
    ADVANCES IN MULTIMEDIA, SOFTWARE ENGINEERING AND COMPUTING, VOL 1, 2011, 128 : 677 - 683
  • [25] Constructing Independent Spanning Trees on Pancake Networks
    Cheng, Dun-Wei
    Chan, Chih-Te
    Hsieh, Sun-Yuan
    IEEE ACCESS, 2020, 8 : 3427 - 3433
  • [26] Spanning Trees in a Closed Chain of Planar Networks
    Lotfi, Dounia
    EL Marraki, Mohamed
    Aboutajdine, Driss
    2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2014, : 1229 - 1234
  • [27] Finding Optimal Spanning Trees For Damaged Networks
    Hamilton, John
    Shahmohamad, Hossein
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2024, 121 : 67 - 70
  • [28] Intersection of random spanning trees in complex networks
    András London
    András Pluhár
    Applied Network Science, 8
  • [29] THE NUMBER OF SPANNING-TREES OF THE REGULAR NETWORKS
    YANG, CS
    WANG, JF
    LEE, JY
    BOESCH, FT
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 23 (3-4) : 185 - 200
  • [30] Independent Spanning Trees on Special BC Networks
    Cheng, Baolei
    Fan, Jianxi
    Yang, Jiwen
    Wang, Yan
    Zhang, Shukui
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 3301 - 3305