On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
1987 ◽
Vol 1
(1)
◽
pp. 33-46
◽
Keyword(s):
Uniform distributions on complicated combinatorial sets can be simulated by the Markov chain method. A condition is given for the simulations to be accurate in polynomial time. Similar analysis of the simulated annealing algorithm remains an open problem. The argument relies on a recent eigenvalue estimate of Alon [4]; the only new mathematical ingredient is a careful analysis of how the accuracy of sample averages of a Markov chain is related to the second-largest eigenvalue.
2016 ◽
Vol 73
(5)
◽
pp. 2001-2017
◽
Keyword(s):
2013 ◽
Vol 32
(12)
◽
pp. 3478-3481
Keyword(s):
2013 ◽
Vol 33
(7)
◽
pp. 1898-1902
◽
2013 ◽
Vol 4
(2)
◽
pp. 20-28