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
We study the fundamental problem of computing Personalized PageRank (PPR) on an undirected and unweighted graph $G$. We focus on the $\eps$-error guarantee introduced by Andersen, Chung, and Lang [ACL; FOCS 2006 $\&$ Internet Math 2007]. Their classic local push method computes an approximate PPR vector satisfying the...
Rong-Hua Li, Quan-Qing Xu, Yi-Chun Yang et al.· 0 citations
This work proposes an algorithm that approximates the number of spanning trees in $\widetilde O(m+n^{3/2}\eps^{-1})$ time and matches the best known size of the determinant sparsifiers.
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.