Potential induced random teleportation on finite graphs

DOI10.1007/S10589-015-9727-7zbMATH Open1326.90094OpenAlexW2083178028MaRDI QIDQ493692FDOQ493692

Authors: Shui-Nee Chow, Xiaojing Ye, Haomin Zhou 

Publication date: 4 September 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-015-9727-7

Recommendations

• Random surfing without teleportation
• Designing good random walks on finite graphs
• Random walks on graphs: ideas, techniques and results
• scientific article; zbMATH DE number 2038774
• scientific article; zbMATH DE number 878897

zbMATH Keywords

random walkMetropolis-Hastings algorithmpotentialfinite graphsGibbs distributionintermittent diffusionrandom teleportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Monte Carlo sampling methods using Markov chains and their applications
• Equation of state calculations by fast computing machines
• Random walk: A modern introduction
• Title not available (Why is that?)
• Deeper Inside PageRank
• Title not available (Why is that?)
• Social network data analytics
• Title not available (Why is that?)
• Random walks on weighted graphs and applications to on-line algorithms
• Modified logarithmic Sobolev inequalities in discrete settings
• Random walks and the effective resistance of networks
• A survey of simulated annealing as a tool for single and multiobjective optimization
• Title not available (Why is that?)
• Random walks on graphs: ideas, techniques and results
• Title not available (Why is that?)
• Title not available (Why is that?)
• The evolution of Markov chain Monte Carlo methods
• The electrical resistance of a graph captures its commute and cover times
• Automata, Languages and Programming
• Cover time of a random graph with given degree sequence
• Optimal partition and effective dynamics of complex networks
• A geometric interpretation of the Metropolis-Hastings algorithm.
• Simulated annealing versus Metropolis for a TSP instance
• Title not available (Why is that?)
• A comparison of simulated annealing cooling strategies

This page was built for publication: Potential induced random teleportation on finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493692)