Meihao Liao
Skip Abstract Section
Skip Supplemental Material SectionAbstract
Resistance distance is a fundamental metric to measure the similarity between two nodes in graphs which has been widely used in many real-world applications. In this paper, we study two problems on approximately computing resistance distance: (i) single-pair query which aims at calculating the resistance distance r(s, t) for a given pair of nodes (s, t); and (ii) single-source query which is to compute all the resistance distances r(s, u) for all nodes u in the graph with a given source node s. Existing algorithms for these two resistance distance query problems are often costly on large graphs. To efficiently solve these problems, we first establish several interesting connections among resistance distance, a new concept called v-absorbed random walk, random spanning forests, and a newly-developed v-absorbed push procedure. Based on such new connections, we propose three novel and efficient sampling-based algorithms as well as a deterministic algorithm for single-pair query; and we develop an online and two index-based approximation algorithms for single-source query. We show that the two index-based algorithms for single-source query take almost the same running time as the algorithms for single-pair query with the aid of a linear-size index. The striking feature of all our algorithms is that they are allowed to select an easy-to-hit node by random walks on the graph. Such an easy-to-hit landmark node v can make the v-absorbed random walk sampling, spanning tree sampling, as well as the v-absorbed push more efficient, thus significantly improving the performance of our algorithms. Extensive experiments on 5 real-life datasets show that our algorithms substantially outperform the state-of-the-art algorithms for two resistance distance query problems in terms of both running time and estimation errors.
Supplemental Material
- 2016. DBLP: DBLP Collaboration Network. http://dblp.uni-trier.de/~ley/db.Google Scholar
- 2022. Project WordGraph. http://www.ims.uni-stuttgart.de/en/research/projects/wordgraph/.Google Scholar
- Vedat Levi Alev, Nima Anari, Lap Chi Lau, and Shayan Oveis Gharan. 2018. Graph Clustering using Effective Resistance. In 9th Innovations in Theoretical Computer Science Conference, ITCS.Google Scholar
- Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, and Shang-Hua Teng. 2008. Local Computation of PageRank Contributions. Internet Math. (2008), 23--45.Google Scholar
- Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. 2006. Local Graph Partitioning using PageRank Vectors. In FOCS. 475--486.Google Scholar
- Eugenio Angriman, Maria Predari, Alexander van der Grinten, and Henning Meyerhenke. 2020. Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. In ESA.Google Scholar
- Konstantin Avrachenkov, Nelly Litvak, Danil Nemirovsky, and Natalia Osipova. 2007. Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient. SIAM J. Numer. Anal. 45, 2 (2007), 890--904.Google ScholarDigital Library
- Ravindra B Bapat. 2010. Graphs and matrices. Vol. 27. Springer.Google Scholar
- Wayne Barrett, Emily J. Evans, Amanda E. Francis, Mark Kempton, and John Sinkovic. 2020. Spanning 2-forests and resistance distance in 2-connected graphs. Discret. Appl. Math. 284 (2020), 341--352.Google ScholarCross Ref
- Pavel Berkhin. 2006. Bookmark-Coloring Approach to Personalized PageRank Computing. Internet Math. 3, 1 (2006), 41--62.Google ScholarCross Ref
- Béla Bollobás. 1998. Modern graph theory. Vol. 184. Springer Science & Business Media.Google Scholar
- Enrico Bozzo and Massimo Franceschet. 2013. Resistance distance, closeness, and betweenness. Social Networks 35, 3 (2013), 460--469.Google ScholarCross Ref
- Seth Chaiken. 1982. A combinatorial proof of the all minors matrix tree theorem. SIAM Journal on Algebraic Discrete Methods 3, 3 (1982), 319--329.Google ScholarDigital Library
- Pavel Chebotarev and Elena Deza. 2020. Hitting time quasi-metric and its forest representation. Optim. Lett. (2020), 291--307.Google Scholar
- Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng. 2011. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In STOC.Google Scholar
- Mustafa Coskun, Ananth Grama, and Mehmet Koyutürk. 2016. Efficient Processing of Network Proximity Queries via Chebyshev Acceleration. In KDD. 1515--1524.Google Scholar
- Mustafa Coskun, Ananth Grama, and Mehmet Koyutürk. 2018. Indexed Fast Network Proximity Querying. VLDB 11, 8 (2018), 840--852.Google ScholarDigital Library
- Peter G. Doyle and J. Laurie Snell. 1984. Random Walks and Electrical Networks. Mathematical Association of America, Washington (1984).Google ScholarCross Ref
- François Fouss, Alain Pirotte, Jean-Michel Renders, and Marco Saerens. 2007. Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Trans. Knowl. Data Eng. 19, 3 (2007), 355--369.Google ScholarDigital Library
- Massimo Franceschet and Enrico Bozzo. 2017. Approximations of the Generalized Inverse of the Graph Laplacian Matrix. Internet Math. (2017).Google Scholar
- Takanori Hayashi, Takuya Akiba, and Yuichi Yoshida. 2016. Efficient Algorithms for Spanning Tree Centrality. In IJCAI. 3733--3739.Google Scholar
- Glen Jeh and Jennifer Widom. 2002. SimRank: a measure of structural-context similarity. In KDD.Google Scholar
- Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. 271--279.Google Scholar
- Jinhong Jung, Namyong Park, Lee Sael, and U Kang. 2017. BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart. In SIGMOD. 789--804.Google Scholar
- Heung-Nam Kim and Abdulmotaleb El-Saddik. 2011. Personalized PageRank vectors for tag recommendations: inside FolkRank. In ACM Conference on Recommender Systems.Google ScholarDigital Library
- Jérôme Kunegis and Stephan Schmidt. 2007. Collaborative Filtering Using Electrical Resistance Network Models. In Industrial Conference on Data Mining.Google Scholar
- Katz Leo. 1953. A new status index derived from sociometric analysis. Psychometrika 18, 1 (1953), 39--43.Google ScholarCross Ref
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.Google Scholar
- Meihao Liao, Rong hua Li, Qiangqiang Dai, Hongyang Chen, Hongchao Qin, and Guoren Wang. 2023. Efficient Resistance Distance Computation: the Power of Landmark-based Approaches. Full version: https://github.com/mhliao516/Resistance-Landmark (2023).Google Scholar
- Meihao Liao, Rong-Hua Li, Qiangqiang Dai, and Guoren Wang. 2022. Efficient Personalized PageRank Computation: A Spanning Forest Sampling based Approach. In SIGMOD. 1996--2008.Google Scholar
- David Liben-Nowell and Jon M. Kleinberg. 2003. The link prediction problem for social networks. In CIKM.Google Scholar
- Dandan Lin, Raymond Chi-Wing Wong, Min Xie, and Victor Junqiu Wei. 2020. Index-Free Approach with Theoretical Guarantee for Efficient Random Walk with Restart Query. In ICDE. 913--924.Google Scholar
- Qin Liu, Zhenguo Li, John C. S. Lui, and Jiefeng Cheng. 2016. PowerWalk: Scalable Personalized PageRank via Random Walks with Vertex-Centric Decomposition. In CIKM. 195--204.Google Scholar
- Peter Lofgren, Siddhartha Banerjee, and Ashish Goel. 2016. Personalized PageRank Estimation and Search: A Bidirectional Approach. In WSDM. 163--172.Google Scholar
- Peter Lofgren and Ashish Goel. 2013. Personalized PageRank to a Target Node. CoRR abs/1304.4658 (2013). arXiv:1304.4658 http://arxiv.org/abs/1304.4658Google Scholar
- László Lovász. 1993. Random walks on graphs. Combinatorics, Paul erdos is eighty 2, 1--46 (1993), 4.Google Scholar
- Russell Lyons and Shayan Oveis Gharan. 2018. Sharp bounds on random walk eigenvalues via spectral embedding. International Mathematics Research Notices 2018, 24 (2018), 7555--7605.Google ScholarCross Ref
- Aleksander Madry, Damian Straszak, and Jakub Tarnawski. 2015. Fast Generation of Random Spanning Trees and the Effective Resistance Metric. In SODA. 2019--2036.Google Scholar
- Fragkiskos D. Malliaros, Christos Giatsidis, Apostolos N. Papadopoulos, and Michalis Vazirgiannis. 2020. The core decomposition of networks: theory, algorithms and applications. VLDB (2020), 61--92.Google Scholar
- Charalampos Mavroforakis, Richard Garcia-Lebron, Ioannis Koutis, and Evimaria Terzi. 2015. Spanning Edge Centrality: Large-scale Computation and Applications. In WWW. 732--742.Google Scholar
- Qiaozhu Mei, Dengyong Zhou, and Kenneth Ward Church. 2008. Query suggestion using hitting time. In CIKM.Google Scholar
- Eisha Nathan and David A. Bader. 2018. Incrementally updating Katz centrality in dynamic graphs. Soc. Netw. Anal. Min. 8, 1 (2018), 26.Google ScholarCross Ref
- Giannis Nikolentzos, Giannis Siglidis, and Michalis Vazirgiannis. 2021. Graph Kernels: A Survey. J. Artif. Intell. Res. 72 (2021), 943--1027.Google ScholarDigital Library
- Pan Peng, Daniel Lopatta, Yuichi Yoshida, and Gramoz Goranci. 2021. Local Algorithms for Estimating Effective Resistance. In KDD. 1329--1338.Google Scholar
- James Gary Propp and David Bruce Wilson. 1998. How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms 27, 2 (1998), 170--217.Google ScholarDigital Library
- Purnamrita Sarkar, Andrew W. Moore, and Amit Prakash. 2008. Fast incremental proximity search in large graphs. In ICML.Google Scholar
- Tamás Sarlós, András A. Benczúr, Károly Csalogány, Dániel Fogaras, and Balázs Rácz. 2006. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In WWW. 297--306.Google Scholar
- Aaron Schild, Satish Rao, and Nikhil Srivastava. 2018. Localization of Electrical Flows. In SODA, Artur Czumaj (Ed.).Google Scholar
- Jieming Shi, Tianyuan Jin, Renchi Yang, Xiaokui Xiao, and Yin Yang. 2020. Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs. Proc. VLDB Endow. 13, 7 (2020), 966--978.Google ScholarDigital Library
- Kijung Shin, Jinhong Jung, Lee Sael, and U Kang. 2015. BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs. In SIGMOD, Timos K. Sellis, Susan B. Davidson, and Zachary G. Ives (Eds.). 1571--1585.Google ScholarDigital Library
- Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, and Kostas Kollias. 2021. Robust Routing Using Electrical Flows. In SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems.Google Scholar
- Daniel A. Spielman and Nikhil Srivastava. 2008. Graph sparsification by effective resistances. In STOC.Google Scholar
- Prasad Tetali. 1991. Random walks and the effective resistance of networks. Journal of Theoretical Probability 4, 1 (1991), 101--109.Google ScholarCross Ref
- Ulrike von Luxburg, Agnes Radl, and Matthias Hein. 2010. Getting lost in space: Large sample analysis of the resistance distance. In NIPS. 2622--2630.Google Scholar
- Ulrike Von Luxburg, Agnes Radl, and Matthias Hein. 2010. Hitting and commute times in large graphs are often misleading. arXiv:1003.1266 (2010).Google Scholar
- Hanzhi Wang, Zhewei Wei, Junhao Gan, Sibo Wang, and Zengfeng Huang. 2020. Personalized PageRank to a Target Node, Revisited. In KDD. 657--667.Google Scholar
- Shuguang Wang and Milos Hauskrecht. 2010. Effective query expansion with the resistance distance based term similarity metric. In SIGIR.Google Scholar
- Sibo Wang, Youze Tang, Xiaokui Xiao, Yin Yang, and Zengxiang Li. 2016. HubPPR: Effective Indexing for Approximate Personalized PageRank. VLDB 10, 3 (2016), 205--216.Google ScholarDigital Library
- Sibo Wang, Renchi Yang, Runhui Wang, Xiaokui Xiao, Zhewei Wei, Wenqing Lin, Yin Yang, and Nan Tang. 2019. Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries. TODS (2019), 18:1--18:37.Google Scholar
- Sibo Wang, Renchi Yang, Xiaokui Xiao, Zhewei Wei, and Yin Yang. 2017. FORA: Simple and Effective Approximate Single-Source Personalized PageRank. In KDD. 505--514.Google ScholarDigital Library
- David Bruce Wilson. 1996. Generating Random Spanning Trees More Quickly than the Cover Time. In STOC.Google Scholar
- Hao Wu, Junhao Gan, Zhewei Wei, and Rui Zhang. 2021. Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push. In SIGMOD. 1996--2008.Google Scholar
- Minji Yoon, Jinhong Jung, and U Kang. 2018. TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs. In ICDE. 1132--1143.Google Scholar
- Zhen Zhang, Mianzhi Wang, Yijian Xiang, Yan Huang, and Arye Nehorai. 2018. RetGK: Graph Kernels based on Return Probabilities of Random Walks. In NeurIPS.Google Scholar
Index Terms
- Efficient Resistance Distance Computation: The Power of Landmark-based Approaches
Recommendations
Resistance distance and Kirchhoff index of R -vertex join and R -edge join of two graphs
Let G = ( V ( G ) , E ( G ) ) be a graph with vertex set V ( G ) and edge set E ( G ) . The R -graph of a graph G , denoted by R ( G ) , is the graph obtained from G by adding a vertex v e and then joining v e to the end vertices of e for each e E ( G ) ...
Resistance distance in straight linear 2-trees
AbstractWe consider the graph G n with vertex set V ( G n ) = { 1 , 2 , … , n } and { i , j } ∈ E ( G n ) if and only if 0 < | i − j | ≤ 2. We call G n the straight linear 2-tree on n vertices. Using Δ–Y transformations and identities for the ...
The unicyclic graphs with maximum degree resistance distance
For a connected graph with order n and size m, the cyclomatic number (=number of independent cycles) is equal to γ = m - n + 1 . The graphs with γ = 1 are referred to the unicyclic graphs. In this paper, we characterized completely the unicyclic graphs ...
Comments