Applications of Temporal Graph Metrics to Real-World Networks
John Tang, Ilias Leontiadis, Salvatore Scellato, Vincenzo Nicosia,, Cecilia Mascolo, Mirco Musolesi, Vito Latora

TL;DR
This paper explores how temporal graph metrics can be applied to analyze real-world networks more accurately than static methods, demonstrating their usefulness in various practical scenarios such as corporate, social, and biological networks.
Contribution
It introduces the application of temporal centrality and efficiency metrics to real-world networks, showcasing their advantages over static analysis in multiple contexts.
Findings
Temporal metrics identify key individuals in corporate networks.
Temporal analysis improves robustness assessment of networks.
Effective strategies for virus containment and immunization are developed.
Abstract
Real world networks exhibit rich temporal information: friends are added and removed over time in online social networks; the seasons dictate the predator-prey relationship in food webs; and the propagation of a virus depends on the network of human contacts throughout the day. Recent studies have demonstrated that static network analysis is perhaps unsuitable in the study of real world network since static paths ignore time order, which, in turn, results in static shortest paths overestimating available links and underestimating their true corresponding lengths. Temporal extensions to centrality and efficiency metrics based on temporal shortest paths have also been proposed. Firstly, we analyse the roles of key individuals of a corporate network ranked according to temporal centrality within the context of a bankruptcy scandal; secondly, we present how such temporal metrics can be used…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
