Visualizing evolving networks

Minimum spanning trees versus Pathfinder networks

Chaomei Chen, Steven Morris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

90 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationIEEE Symposium on Information Visualization 2003, InfoVis 2003
Pages67-74
Number of pages8
DOIs
Publication statusPublished - 2003 Dec 1
Event9th Annual IEEE Symposium on Information Visualization, InfoVis 2003 - Seattle, WA, United States
Duration: 2003 Oct 192003 Oct 21

Publication series

NameProceedings - IEEE Symposium on Information Visualization, INFO VIS
ISSN (Print)1522-404X

Other

Other9th Annual IEEE Symposium on Information Visualization, InfoVis 2003
CountryUnited States
CitySeattle, WA
Period03/10/1903/10/21

Fingerprint

Visualization
Complex networks
Small-world networks
Model structures
Animation
Large scale systems

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Chen, C., & Morris, S. (2003). Visualizing evolving networks: Minimum spanning trees versus Pathfinder networks. In IEEE Symposium on Information Visualization 2003, InfoVis 2003 (pp. 67-74). [1249010] (Proceedings - IEEE Symposium on Information Visualization, INFO VIS). https://doi.org/10.1109/INFVIS.2003.1249010
Chen, Chaomei ; Morris, Steven. / Visualizing evolving networks : Minimum spanning trees versus Pathfinder networks. IEEE Symposium on Information Visualization 2003, InfoVis 2003. 2003. pp. 67-74 (Proceedings - IEEE Symposium on Information Visualization, INFO VIS).
@inproceedings{1eb5bd1f14db4ea4ae7d8e1c8c50ed01,
title = "Visualizing evolving networks: Minimum spanning trees versus Pathfinder networks",
abstract = "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.",
author = "Chaomei Chen and Steven Morris",
year = "2003",
month = "12",
day = "1",
doi = "10.1109/INFVIS.2003.1249010",
language = "English",
isbn = "0780381548",
series = "Proceedings - IEEE Symposium on Information Visualization, INFO VIS",
pages = "67--74",
booktitle = "IEEE Symposium on Information Visualization 2003, InfoVis 2003",

}

Chen, C & Morris, S 2003, Visualizing evolving networks: Minimum spanning trees versus Pathfinder networks. in IEEE Symposium on Information Visualization 2003, InfoVis 2003., 1249010, Proceedings - IEEE Symposium on Information Visualization, INFO VIS, pp. 67-74, 9th Annual IEEE Symposium on Information Visualization, InfoVis 2003, Seattle, WA, United States, 03/10/19. https://doi.org/10.1109/INFVIS.2003.1249010

Visualizing evolving networks : Minimum spanning trees versus Pathfinder networks. / Chen, Chaomei; Morris, Steven.

IEEE Symposium on Information Visualization 2003, InfoVis 2003. 2003. p. 67-74 1249010 (Proceedings - IEEE Symposium on Information Visualization, INFO VIS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Visualizing evolving networks

T2 - Minimum spanning trees versus Pathfinder networks

AU - Chen, Chaomei

AU - Morris, Steven

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78649612624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649612624&partnerID=8YFLogxK

U2 - 10.1109/INFVIS.2003.1249010

DO - 10.1109/INFVIS.2003.1249010

M3 - Conference contribution

SN - 0780381548

SN - 9780780381544

T3 - Proceedings - IEEE Symposium on Information Visualization, INFO VIS

SP - 67

EP - 74

BT - IEEE Symposium on Information Visualization 2003, InfoVis 2003

ER -

Chen C, Morris S. Visualizing evolving networks: Minimum spanning trees versus Pathfinder networks. In IEEE Symposium on Information Visualization 2003, InfoVis 2003. 2003. p. 67-74. 1249010. (Proceedings - IEEE Symposium on Information Visualization, INFO VIS). https://doi.org/10.1109/INFVIS.2003.1249010