Laws of large numbers for the annealing algorithm
From MaRDI portal
Publication:751733
DOI10.1016/0304-4149(90)90009-HzbMath0715.60089WikidataQ115104697 ScholiaQ115104697MaRDI QIDQ751733
Publication date: 1990
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (max. 100)
On discrete inhomogeneous exit problems ⋮ Remarks on the ergodicity of simulated annealing algorithms on a graph ⋮ Turning a coin over instead of tossing it ⋮ Stick-breaking processes, clumping, and Markov chain occupation laws
Cites Work
This page was built for publication: Laws of large numbers for the annealing algorithm