Edges Matter: An Analysis of Graph Time-Series Representations for Temporal Networks

Representations of temporal networks arising from a stream of edges lie at the heart of models learned on it and its performance on downstream applications. Previous modeling work has mainly represented a stream of timestamped edges using a time-series of graphs based on a specific time-scale <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\tau$</tex-math></inline-formula> (e.g., 1 mo). In contrast, it has recently been shown that constructing a time-series of graphs where each graph maintains a fixed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> number of edges, namely <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graph time-series, leads to better performance on downstream applications, but there has yet to be a detailed investigation on why <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graphs outperform <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\tau$</tex-math></inline-formula>-graphs. In this work, we design extensive experiments on a benchmark of over 25 temporal network datasets, investigating the impact of edge randomization and the various representations on graph statistics. Our results indicate that the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graph time-series representation effectively captures the structural properties of the graphs across time whereas the commonly used <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\tau$</tex-math></inline-formula>-graph time-series mostly captures the frequency of edges. This motivates the need for a paradigm shift to developing temporal network representation learning frameworks built upon <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graph time-series. To help pave the way, we release a benchmark for the evaluation and development of better models.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-06-09
DOI
https://doi.org/10.1109/tnse.2025.3577402
Primary Topic
Data Visualization and Analytics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Edges Matter: An Analysis of Graph Time-Series Representations for Temporal Networks

Ryan A. Rossi, Tyler Derr, Hoda Eldardiry, Nesreen K. Ahmed et al.
IEEE Transactions on Network Science and Engineering
Data Visualization and Analytics
article

Edges Matter: An Analysis of Graph Time-Series Representations for Temporal Networks

Ryan A. Rossi, Tyler Derr, Hoda Eldardiry, Nesreen K. Ahmed, Namyong Park, Yu Wang, Hongjie Chen
article en

Abstract

Representations of temporal networks arising from a stream of edges lie at the heart of models learned on it and its performance on downstream applications. Previous modeling work has mainly represented a stream of timestamped edges using a time-series of graphs based on a specific time-scale <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\tau$</tex-math></inline-formula> (e.g., 1 mo). In contrast, it has recently been shown that constructing a time-series of graphs where each graph maintains a fixed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> number of edges, namely <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graph time-series, leads to better performance on downstream applications, but there has yet to be a detailed investigation on why <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graphs outperform <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\tau$</tex-math></inline-formula>-graphs. In this work, we design extensive experiments on a benchmark of over 25 temporal network datasets, investigating the impact of edge randomization and the various representations on graph statistics. Our results indicate that the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graph time-series representation effectively captures the structural properties of the graphs across time whereas the commonly used <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\tau$</tex-math></inline-formula>-graph time-series mostly captures the frequency of edges. This motivates the need for a paradigm shift to developing temporal network representation learning frameworks built upon <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula>-graph time-series. To help pave the way, we release a benchmark for the evaluation and development of better models.

IEEE Transactions on Network Science and EngineeringVol. 12(6)
Dolby (Netherlands) (NL), Adobe Systems (United States) (US), Cisco Systems (China) (CN), University of Oregon (US), Vanderbilt University (US), Cisco College (US), Dolby (United States) (US), Cisco Systems (United States) (US), Carnegie Mellon University (US), Virginia Tech (US)
Openalex Percentile: Top 89%
Data Visualization and Analytics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.