ProbeWalk: 通过探针驱动的随机游走快速估计图上的双调和距离
ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
AI总结:
ProbeWalk通过探针驱动的随机游走方法,高效估计图上的双调和距离,显著降低计算复杂度并提升处理速度。
摘要:
双调和距离是图上的一项基本度量,用于衡量两个节点之间的差异性,捕捉局部和全局结构。它已在网络中心性、图聚类和机器学习等多个领域中得到应用。这些应用通常需要高效地评估成对的双调和距离。然而,现有算法仍然计算成本很高。最先进的方法在绝对误差保证epsilon_abs下具有时间复杂度O(L^5 / epsilon_abs^2),其中L表示截断长度。在本工作中,我们通过探针驱动的随机游走将复杂度降低到O(L^3 / epsilon^2),在相对误差保证epsilon下。我们提供相对误差保证而不是绝对误差保证,因为双调和距离在节点对之间可能相差多个数量级。由于L在现实网络中往往非常大(例如,L >= 10^3),将L的依赖性从第五次方降低到第三次方带来了显著的提升。在现实网络上的广泛实验表明,我们的方法在达到匹配的相对误差下,相比强大的基线方法提供了10倍到1000倍的每查询加速,并且能够扩展到拥有数千万节点的图。
英文摘要:
The biharmonic distance is a fundamental metric on graphs that measures the dissimilarity between two nodes, capturing both local and global structures. It has found applications across various fields, including network centrality, graph clustering, and machine learning. These applications typically require efficient evaluation of pairwise biharmonic distances. However, existing algorithms remain computationally expensive. The state-of-the-art method attains an absolute-error guarantee epsilon_abs with time complexity O(L^5 / epsilon_abs^2), where L denotes the truncation length. In this work, we improve the complexity to O(L^3 / epsilon^2) under a relative-error guarantee epsilon via probe-driven random walks. We provide a relative-error guarantee rather than an absolute-error guarantee because biharmonic distances vary by orders of magnitude across node pairs. Since L is often very large in real-world networks (for example, L >= 10^3), reducing the L-dependence from the fifth to the third power yields substantial gains. Extensive experiments on real-world networks show that our method delivers 10x-1000x per-query speedups at matched relative error over strong baselines and scales to graphs with tens of millions of nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。