Zuobai Zhang
ABSTRACT
For random walks on a graph, the mean hitting time $H_j$ from a vertex i chosen from the stationary distribution to the target vertex j can be used as a measure of importance for vertex j, while the Kemeny constant K is the mean hitting time from a vertex i to a vertex j selected randomly according to the stationary distribution. Both quantities have found a large variety of applications in different areas. However, their high computational complexity limits their applications, especially for large networks with millions of vertices. In this paper, we first establish a connection between the two quantities, representing K in terms of $H_j$ for all vertices. We then express both quantities in terms of quadratic forms of the pseudoinverse for graph Laplacian, based on which we develop an efficient algorithm that provides an approximation of $H_j$ for all vertices and K in nearly linear time with respect to the edge number, with high probability. Extensive experiment results on real-life and model networks validate both the efficiency and accuracy of the proposed algorithm.
- Dimitris Achlioptas. 2001. Database-friendly random projections. In Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, 274--281.Google Scholar
Digital Library
- A Barrat, M Barthelemy, R Pastor-Satorras, and A Vespignani. 2004. The architecture of complex weighted networks . Proceedings of the National Academy of Sciences of the United States of America , Vol. 101 , 11 (MAR 16 2004), 3747--3752 .Google ScholarCross Ref
- Adi Ben-Israel and Thomas N. E Greville. 1974. Generalized inverses: theory and applications .J. Wiley. 406--413 pages.Google Scholar
- Andrew Beveridge. 2009. Centers for random walks on trees. SIAM Journal on Discrete Mathematics , Vol. 23, 1 (2009), 300--318.Google ScholarDigital Library
- Andrew Beveridge. 2016. A Hitting Time Formula for the Discrete Green's Function. Combinatorics, Probability and Computing , Vol. 25, 3 (2016), 362--379.Google ScholarCross Ref
- M. Chen, J. Z. Liu, and X. Tang. 2008. Clustering via Random Walk Hitting Time on Directed Graphs. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence. AAAI, 616--621.Google Scholar
- Fan RK Chung. 1997. Spectral Graph Theory .American Mathematical Society, Providence, RI.Google ScholarDigital Library
- Michael B Cohen, Rasmus Kyng, Gary L Miller, Jakub W Pachocki, Richard Peng, Anup B Rao, and Shen Chen Xu. 2014. Solving SDD linear systems in nearly m log 1/2 n time. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing. ACM, 343--352.Google ScholarDigital Library
- S Condamin, O Bénichou, V Tejedor, R Voituriez, and J Klafter. 2007. First-passage times in complex scale-invariant media. Nature , Vol. 450, 7166 (2007), 77--80.Google Scholar
- Peter G Doyle and J Laurie Snell. 1984. Random Walks and Electric Networks .Mathematical Association of America.Google Scholar
- Francois Fouss, Alain Pirotte, J-M Renders, and Marco Saerens. 2007. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering , Vol. 19, 3 (2007), 355--369.Google ScholarDigital Library
- Arpita Ghosh, Stephen Boyd, and Amin Saberi. 2008. Minimizing effective resistance of a graph. SIAM Rev. , Vol. 50, 1 (2008), 37--66.Google ScholarDigital Library
- Leo Grady. 2006. Random walks for image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence , Vol. 28, 11 (2006), 1768--1783.Google ScholarDigital Library
- Jeffrey J Hunter. 2006. Mixing times with applications to perturbed Markov chains . Linear Algebra Appl. , Vol. 417, 1 (2006), 108--123.Google ScholarCross Ref
- Jeffrey J Hunter. 2014. The role of Kemeny's constant in properties of Markov chains . Communications in Statistics -- Theory and Methods , Vol. 43, 7 (2014), 1309--1321.Google Scholar
- Ali Jadbabaie and Alex Olshevsky. 2019. Scaling Laws for Consensus Protocols Subject to Noise . IEEE Trans. Automat. Control , Vol. 64, 4 (2019), 1389--1402.Google ScholarCross Ref
- Douglas J Klein and Milan Randić. 1993. Resistance distance. Journal of Mathematical Chemistry , Vol. 12, 1 (1993), 81--95.Google ScholarCross Ref
- Ioannis Koutis, Gary L Miller, and Richard Peng. 2011. A nearly-m log n time solver for SDD linear systems. In Proceedings of 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. IEEE, 590--598.Google ScholarDigital Library
- Jérôme Kunegis. 2013. KONECT: The Koblenz Network Collection. In Proceedings of the 22nd International Conference on World Wide Web. ACM, New York, USA, 1343--1350.Google ScholarDigital Library
- Rasmus Kyng and Sushant Sachdeva. 2016. Approximate Gaussian elimination for Laplacians - fast, sparse, and simple. In Proceedings of IEEE 57th Annual Symposium on Foundations of Computer Science. IEEE, 573--582.Google ScholarCross Ref
- Renaud Lambiotte, Jean-Charles Delvenne, and Mauricio Barahona. 2014. Random walks, Markov processes and the multiscale modular organization of complex networks. IEEE Transactions on Network Science and Engineering , Vol. 1, 2 (2014), 76--90.Google ScholarCross Ref
- Mark Levene and George Loizou. 2002. Kemeny's Constant and the Random Surfer. The American Mathematical Monthly , Vol. 109, 8 (2002), 741--745.Google ScholarCross Ref
- David Asher Levin, Yuval Peres, and Elizabeth Lee Wilmer. 2009. Markov Chains and Mixing Times. American Mathematical Society, Providence, RI.Google Scholar
- Huan Li and Aaron Schild. 2018. Spectral Subspace Sparsification. In Proceedings of 2018 IEEE 59th Annual Symposium on Foundations of Computer Science. IEEE, 385--396.Google ScholarCross Ref
- Yuan Lin and Zhongzhi Zhang. 2013. Random walks in weighted networks with a perfect trap: An application of Laplacian spectra. Physical Review E , Vol. 87, 6 (2013), 062140.Google ScholarCross Ref
- Oren E Livne and Achi Brandt. 2012. Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver . SIAM Journal on Scientific Computing , Vol. 34, 4 (2012), B499--B522.Google ScholarDigital Library
- László Lovász. 1993. Random walks on graphs: A survey . Combinatorics, Paul Erdös is eighty , Vol. 2, 1 (1993), 1--46.Google Scholar
- Charalampos Mavroforakis, Michael Mathioudakis, and Aristides Gionis. 2015. Absorbing random-walk centrality: Theory and algorithms. In Proceedings of the 15th IEEE International Conference on Data Mining. IEEE, 901--906.Google ScholarDigital Library
- Qiaozhu Mei, Dengyong Zhou, and Kenneth Church. 2008. Query suggestion using hitting time. In Proceedings of the 17th ACM conference on Information and Knowledge Management. ACM, 469--478.Google ScholarDigital Library
- M. E. J. Newman. 2003. The Structure and Function of Complex Networks. SIAM Rev. , Vol. 45, 2 (2003), 167--256.Google ScholarDigital Library
- Mark E. J. Newman. 2005. A measure of betweenness centrality based on random walks. Social Networks , Vol. 27, 1 (2005), 39--54.Google ScholarCross Ref
- Rushabh Patel, Pushkarini Agharkar, and Francesco Bullo. 2015. Robotic surveillance and Markov chains with minimal weighted Kemeny constant . IEEE Transatcions on Automatic Control , Vol. 60, 12 (2015), 3156--3167.Google ScholarCross Ref
- Anand Dilip Sarwate and Alexandros G Dimakis. 2012. The impact of mobility on gossip algorithms. IEEE Transactoins on Information Theory , Vol. 58, 3 (2012), 1731--1742.Google ScholarDigital Library
- Daniel A Spielman. 2010. Algorithms, graph theory, and linear equations in Laplacian matrices. In Proceedings of the International Congress of Mathematicians. World Scientific, 2698--2722.Google Scholar
- Daniel A Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth Annual ACM Symposium on Theory of Computing. ACM, 81--90.Google ScholarDigital Library
- V Tejedor, O Bénichou, and R Voituriez. 2009. Global mean first-passage times of random walks on complex networks. Physical Review E , Vol. 80, 6 (2009), 065104.Google ScholarCross Ref
- Prasad Tetali. 1991. Random walks and the effective resistance of networks. Journal of Theoretical Probability , Vol. 4, 1 (1991), 101--109.Google ScholarCross Ref
- Scott White and Padhraic Smyth. 2003. Algorithms for estimating relative importance in networks. In Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . ACM, 266--275.Google ScholarDigital Library
- Shunqi Wu, Zhongzhi Zhang, and Guanrong Chen. 2011. Random walks on dual Sierpi'nski gaskets. The European Physical Journal B , Vol. 82, 1 (2011), 91--96.Google ScholarCross Ref
- Pinchen Xie, Yuan Lin, and Zhongzhi Zhang. 2015. Spectrum of walk matrix for Koch network and its application . Journal of Chemical Physics , Vol. 142, 22 (2015), 224106.Google ScholarCross Ref
- Pinchen Xie, Zhongzhi Zhang, and Francesc Comellas. 2016. On the spectrum of the normalized Laplacian of iterated triangulations of graphs . Appl. Math. Comput. , Vol. 273 (2016), 1123--1129.Google ScholarDigital Library
Index Terms
- Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph
Recommendations
Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks
WWW '20: Proceedings of The Web Conference 2020The mean hitting time from a node i to a node j selected randomly according to the stationary distribution of random walks is called the Kemeny constant, which has found various applications. It was proved that over all graphs with N vertices, complete ...
The Hitting Times of Random Walks on Bicyclic Graphs
AbstractLet be the expected hitting time from vertex x to vertex y for the first time on a simple connected graph G and be called the hitting time of G. In this paper, sharp upper and lower bounds for among all n-...
The hitting and cover times of random walks on finite graphs using local degree information
Standard random walks on finite graphs select the vertex visited next to the adjacent vertices at random with the same probability. Despite not using any global topological information, they guarantee O(n^3) hitting and cover times for any graph, where ...
Comments