Node representation learning on dynamic graphs is a fundamental task for numerous real-world applications. However, existing dynamic Graph Neural Networks (GNNs) face two critical challenges: (1) the inability to effectively model crucial directional information inherent in many real-world interactions, and (2) suffer...
Ze-Ning Li, Rong-Hua Li, Yi-Chun Yang et al.· Proceedings of the 35th ACM...· 0 citations
Resistance distance computation is a fundamental problem in graph data management. To avoid the high latency of online evaluation, recent work builds offline indexes. Existing approaches, however, fall into two families with complementary weaknesses: loop-erased random-walk methods (e.g., LEIndex) are efficient on fa...
Mei-Hao Liao, Bao Xing, Rong-Hua Li et al.· Proceedings of the ACM on Ma...· 0 citations
It is proved that every constant-success estimator with Wasserstein--$1$ error at most $\eps$ requires $2^{\Omega(1/\eps)}$ queries, showing that the Cohen-Steiner algorithm is optimal up to constant in the exponent.