Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks

The 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 graphs have the exact minimum Kemeny constant, growing linearly with N. Here we study numerically or analytically the Kemeny constant on many sparse real-world and model networks with scale-free small-world topology, and show that their Kemeny constant also behaves linearly with N. Thus, sparse networks with scale-free and small-world topology are favorable architectures with optimal scaling of Kemeny constant. We then present a theoretically guaranteed estimation algorithm, which approximates the Kemeny constant for a graph in nearly linear time with respect to the number of edges. Extensive numerical experiments on model and real networks show that our approximation algorithm is both efficient and accurate.

[1]  Wen-Huang Cheng,et al.  Background Extraction Using Random Walk Image Fusion , 2018, IEEE Transactions on Cybernetics.

[2]  M. Chupeau,et al.  Cover times of random searches , 2015, Nature Physics.

[3]  Steve Kirkland,et al.  Fastest expected time to mixing for a Markov chain on a directed graph , 2010 .

[4]  M. Hutchinson.  A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines , 1989 .

[5]  Athanasios V. Vasilakos,et al.  Estimating Graph Robustness Through the Randic Index , 2018, IEEE Transactions on Cybernetics.

[6]  Guanrong Chen,et al.  Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network , 2015, Comput. J..

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

[8]  P. Van Mieghem,et al.  Virus Spread in Networks , 2009, IEEE/ACM Transactions on Networking.

[9]  Shuigeng Zhou,et al.  A general geometric growth model for pseudofractal scale-free web , 2007 .

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

[11]  J. S. Andrade,et al.  Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. , 2004, Physical review letters.

[12]  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).

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

[14]  Bin Wu,et al.  Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: analytical results and applications. , 2013, The Journal of chemical physics.

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Zhongzhi Zhang,et al.  Spectral Properties of Extended Sierpiński Graphs and Their Applications , 2019, IEEE Transactions on Network Science and Engineering.

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

[18]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[19]  Bo Zhou,et al.  On resistance-distance and Kirchhoff index , 2009 .

[20]  Marco Saerens,et al.  A bag-of-paths node criticality measure , 2017, Neurocomputing.

[21]  J. Douglas.  Aspects and applications of the random walk , 1995 .

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

[23]  Jonathan P K Doye,et al.  Self-similar disk packings as model spatial scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[25]  Mason A. Porter,et al.  Random walks and diffusion on networks , 2016, ArXiv.

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

[27]  Zhi-Li Zhang,et al.  Random Walks and Green's Function on Digraphs: A Framework for Estimating Wireless Transmission Costs , 2013, IEEE/ACM Transactions on Networking.

[28]  Richard Peng,et al.  Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[29]  Christos Faloutsos,et al.  Epidemic thresholds in real networks , 2008, TSEC.

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

[31]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[32]  Bernd Heidergott,et al.  Analysis of Markov Influence Graphs , 2019, Oper. Res..

[33]  Marco Saerens,et al.  Algorithms and Models for Network Data and Link Analysis , 2016 .

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

[35]  Francesco Bullo,et al.  Robotic surveillance and Markov chains with minimal first passage time , 2014, 53rd IEEE Conference on Decision and Control.

[36]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

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

[38]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Guanrong Chen,et al.  Exact eigenvalue spectrum of a class of fractal scale-free networks , 2012, 1207.1546.

[40]  Yi Qi,et al.  Extended corona product as an exactly tractable model for weighted heterogeneous networks , 2017, Comput. J..

[41]  Huchuan Lu,et al.  Visual Tracking via Random Walks on Graph Model , 2016, IEEE Transactions on Cybernetics.

[42]  Stacy Patterson,et al.  Scale-Free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks , 2018, IEEE Transactions on Cybernetics.

[43]  E. Bozzo.  The Moore–Penrose inverse of the normalized graph Laplacian , 2013 .

[44]  A. A. Abin,et al.  A Random Walk Approach to Query Informative Constraints for Clustering , 2018, IEEE Transactions on Cybernetics.

[45]  Wen Jiang,et al.  Random Walk-Based Solution to Triple Level Stochastic Point Location Problem , 2016, IEEE Transactions on Cybernetics.

[46]  Zhongzhi Zhang,et al.  Full eigenvalues of the Markov matrix for scale-free polymer networks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[48]  Guanrong Chen,et al.  Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network , 2017, IEEE Transactions on Control Systems Technology.

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

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

[51]  José Luis Palacios,et al.  Bounds for the Kirchhoff index of regular graphs via the spectra of their random walks , 2010 .

[52]  Zhongzhi Zhang,et al.  The normalized Laplacian spectrum of subdivisions of a graph , 2015, Appl. Math. Comput..

[53]  Shuigeng Zhou,et al.  Evolving Apollonian networks with small-world scale-free topologies. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[55]  C. ReinaldoA.Vallejos,et al.  A Fast Transformation of Markov Chains and Their Respective Steady-State Probability Distributions , 2014, Comput. J..

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

[57]  Sivan Toledo,et al.  Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix , 2011, JACM.