Potential induced random teleportation on finite graphs
From MaRDI portal
Publication:493692
DOI10.1007/s10589-015-9727-7zbMath1326.90094OpenAlexW2083178028MaRDI QIDQ493692
Xiaojing Ye, Shui-Nee Chow, Hao-Min 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
potentialrandom walkGibbs distributionMetropolis-Hastings algorithmfinite graphsintermittent diffusionrandom teleportation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cover time of a random graph with given degree sequence
- Random walks and the effective resistance of networks
- Modified logarithmic Sobolev inequalities in discrete settings
- The electrical resistance of a graph captures its commute and cover times
- A geometric interpretation of the Metropolis-Hastings algorithm.
- Simulated annealing versus Metropolis for a TSP instance
- Social Network Data Analytics
- The Evolution of Markov Chain Monte Carlo Methods
- Optimal partition and effective dynamics of complex networks
- Random walks on weighted graphs and applications to on-line algorithms
- A survey of simulated annealing as a tool for single and multiobjective optimization
- Random Walk: A Modern Introduction
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- A comparison of simulated annealing cooling strategies
- Random walks on graphs: ideas, techniques and results
- Deeper Inside PageRank
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
- Automata, Languages and Programming