Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph

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.

[1]  Dimitris Achlioptas,et al.  Database-friendly random projections , 2001, PODS.

[2]  Padhraic Smyth,et al.  Algorithms for estimating relative importance in networks , 2003, KDD '03.

[3]  Huan Li,et al.  Spectral Subspace Sparsification , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[5]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[6]  Achi Brandt,et al.  Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver , 2011, SIAM J. Sci. Comput..

[7]  ANDREW BEVERIDGE.  A Hitting Time Formula for the Discrete Green's Function , 2016, Comb. Probab. Comput..

[8]  Andrew Beveridge.  Centers for Random Walks on Trees , 2009, SIAM J. Discret. Math..

[9]  Francesco Bullo,et al.  Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant , 2015, IEEE Transactions on Automatic Control.

[10]  J. Hunter.  The Role of Kemeny's Constant in Properties of Markov Chains , 2012, 1208.4716.

[11]  Gary L. Miller,et al.  A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[12]  Kenneth Ward Church,et al.  Query suggestion using hitting time , 2008, CIKM '08.

[13]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[14]  P. Tetali.  Random walks and the effective resistance of networks , 1991 .

[15]  D. Spielman.  Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices , 2011 .

[16]  Jakub W. Pachocki,et al.  Solving SDD linear systems in nearly mlog1/2n time , 2014, STOC.

[17]  Zhongzhi Zhang,et al.  Spectrum of walk matrix for Koch network and its application. , 2015, The Journal of chemical physics.

[18]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[19]  Zhongzhi Zhang,et al.  Random walks on dual Sierpinski gaskets , 2011 .

[20]  I. I. M. S. Massey.  Mixing Times with Applications to Perturbed Markov Chains , 2003 .

[21]  Alex Olshevsky,et al.  Scaling Laws for Consensus Protocols Subject to Noise , 2015, IEEE Transactions on Automatic Control.

[22]  Zhongzhi Zhang,et al.  Random walks in weighted networks with a perfect trap: an application of Laplacian spectra. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[24]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[25]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[26]  O. Bénichou,et al.  Global mean first-passage times of random walks on complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  M. Randic,et al.  Resistance distance , 1993 .

[28]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[29]  Mark Levene,et al.  Kemeny's Constant and the Random Surfer , 2002, Am. Math. Mon..

[30]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[31]  Jean-Charles Delvenne,et al.  Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks , 2014, IEEE Transactions on Network Science and Engineering.

[32]  Zhongzhi Zhang,et al.  On the spectrum of the normalized Laplacian of iterated triangulations of graphs , 2015, Appl. Math. Comput..

[33]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[34]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[35]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[36]  Alexandros G. Dimakis,et al.  The Impact of Mobility on Gossip Algorithms , 2012, IEEE Transactions on Information Theory.

[37]  Mo Chen,et al.  Clustering via Random Walk Hitting Time on Directed Graphs , 2008, AAAI.

[38]  Aristides Gionis,et al.  Absorbing Random-Walk Centrality: Theory and Algorithms , 2015, 2015 IEEE International Conference on Data Mining.

[39]  J. Klafter,et al.  First-passage times in complex scale-invariant media , 2007, Nature.

[40]  Sushant Sachdeva,et al.  Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[41]  Adi Ben-Israel,et al.  Generalized inverses: theory and applications , 1974 .