TEA: A General-Purpose Temporal Graph Random Walk Engine

Chengying Huan, Shuaiwen Leon Song, Santosh Pandey et al. · 2023

Many real-world graphs are temporal in nature, where the temporal information indicates when a particular edge is changed (e.g., edge insertion and deletion). Performing random walks on such temporal graphs is of paramount value. The state-of-the-art sampling strategies are tailored for conventional static graphs and thus cannot effectively tackle the dynamic nature of temporal graphs due to several significant efficiency challenges, i.e., high sampling complexity, gigantic index space, and poor programmability.

Cited by 11 works. doi:10.1145/3552326.3567491 Open-access PDF

Authors

References