Potential induced random teleportation on finite graphs
type: Item
instance of: scholarly article
title: Potential induced random teleportation on finite graphs
zbMATH Open document ID: 1326.90094
author: Shui-Nee Chow
author: Xiaojing Ye
author: Haomin Zhou
published in: Computational Optimization and Applications
publication date: 2015-09-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6478552
zbMATH Keywords: random walk
zbMATH Keywords: random teleportation
zbMATH Keywords: potential
zbMATH Keywords: intermittent diffusion
zbMATH Keywords: Gibbs distribution
zbMATH Keywords: Metropolis-Hastings algorithm
zbMATH Keywords: finite graphs
MaRDI profile type: Publication
full work available at URL: s10589-015-9727-7
OpenAlex ID: W2083178028
cites work: Cover time of a random graph with given degree sequence
cites work: Social Network Data Analytics
cites work: Q4035822
cites work: Q4830378
cites work: A geometric interpretation of the Metropolis-Hastings algorithm.
cites work: Modified logarithmic Sobolev inequalities in discrete settings
cites work: Random walks on graphs: ideas, techniques and results
cites work: The electrical resistance of a graph captures its commute and cover times
cites work: Random walks on weighted graphs and applications to on-line algorithms
cites work: Deeper Inside PageRank
cites work: Q3706275
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Monte Carlo sampling methods using Markov chains and their applications
cites work: Q2941641
cites work: Q3224016
cites work: Random Walk: A Modern Introduction
cites work: Simulated annealing versus Metropolis for a TSP instance
cites work: Equation of State Calculations by Fast Computing Machines
cites work: A comparison of simulated annealing cooling strategies
cites work: The Evolution of Markov Chain Monte Carlo Methods
cites work: A survey of simulated annealing as a tool for single and multiobjective optimization
cites work: Random walks and the effective resistance of networks
cites work: Q4748912
cites work: Automata, Languages and Programming
cites work: Q4863397
cites work: Optimal partition and effective dynamics of complex networks
DOI: 10.1007/S10589-015-9727-7
description: scientific article; zbMATH DE number 6478552