Visualizing evolving networks: minimum spanning trees versus pathfinder networks

摘要: Network evolution is an ubiquitous phenomenon in a wide variety of complex systems. There increasing interest statistically modeling the networks such as small-world and scale-free networks. In this article, we address practical issue concerning visualizations co-citation scientific publications derived by two widely known link reduction algorithms, namely minimum spanning trees (MSTs) pathfinder (PFNETs). Our primary goal to identify strengths weaknesses methods fulfilling need for visualizing evolving Two criteria are assessing terms topological properties dynamical properties. We examine animated visualization models botulinum toxin research its structure across 58-year span (1945-2002). The results suggest that although high-degree nodes dominate MST models, structures can be inadequate depicting essence how network evolves because removes potentially significant links from high-order shortest paths. contrast, PFNET clearly demonstrate their superiority maintaining cohesiveness some most pivotal paths, which turn make growth animation more predictable interpretable. design tools should take critical paths into account.