Potential induced random teleportation on finite graphs

We propose and analyze a potential induced random walk and its modification called random teleportation on finite graphs. The transition probability is determined by the gaps between potential values of adjacent and teleportation nodes. We show that the steady state of this process has a number of desirable properties. We present a continuous time analogue of the random walk and teleportation, and derive the lower bound on the order of its exponential convergence rate to stationary distribution. The efficiency of proposed random teleportation in search of global potential minimum on graphs and node ranking are demonstrated by numerical tests. Moreover, we discuss the condition of graphs and potential distributions for which the proposed approach may work inefficiently, and introduce the intermittent diffusion strategy to overcome the problem and improve the practical performance.

[1]  D. Cassi,et al.  Random walks on graphs: ideas, techniques and results , 2005 .

[2]  Klaus Meer,et al.  Simulated Annealing versus Metropolis for a TSP instance , 2007, Inf. Process. Lett..

[3]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[4]  Charu C. Aggarwal,et al.  Social Network Data Analytics , 2011 .

[5]  Tiejun Li,et al.  Optimal partition and effective dynamics of complex networks , 2008, Proceedings of the National Academy of Sciences.

[6]  Douglas J. Klein,et al.  Random Walks and Chemical Graph Theory , 2004, J. Chem. Inf. Model..

[7]  Bernd A. Berg.  Markov Chain Monte Carlo Simulations and Their Statistical Analysis , 2004 .

[8]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  David Aldous,et al.  Applications of Random Walks on Finite Graphs , 1991 .

[10]  N. Kampen,et al.  Stochastic processes in physics and chemistry , 1981 .

[11]  Matthew Richey,et al.  The Evolution of Markov Chain Monte Carlo Methods , 2010, Am. Math. Mon..

[12]  B. Suman,et al.  A survey of simulated annealing as a tool for single and multiobjective optimization , 2006, J. Oper. Res. Soc..

[13]  D. Sherrington.  Stochastic Processes in Physics and Chemistry , 1983 .

[14]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.

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

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

[17]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[18]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[19]  S. Bobkov,et al.  Modified Logarithmic Sobolev Inequalities in Discrete Settings , 2006 .

[20]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[21]  Alan M. Frieze,et al.  Cover time of a random graph with given degree sequence , 2012, Discret. Math..

[22]  Gregory F. Lawler,et al.  Random Walk: A Modern Introduction , 2010 .

[23]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[24]  Prabhakar Raghavan,et al.  Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.

[25]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[26]  P. Diaconis,et al.  A geometric interpretation of the Metropolis-Hastings algorithm , 2001 .

[27]  Ingo Wegener,et al.  Simulated Annealing Beats Metropolis in Combinatorial Optimization , 2005, ICALP.

[28]  G. Weiss.  Aspects and Applications of the Random Walk , 1994 .

[29]  Minas Gjoka,et al.  A Walk in Facebook: Uniform Sampling of Users in Online Social Networks , 2009, ArXiv.

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

[31]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[32]  Yaghout Nourani,et al.  A comparison of simulated annealing cooling strategies , 1998 .

[33]  Purnamrita Sarkar,et al.  Random Walks in Social Networks and their Applications: A Survey , 2011, Social Network Data Analytics.

[34]  G. Casella,et al.  Explaining the Gibbs Sampler , 1992 .