A Remark on Zhong-Yang's Eigenvalue Estimate

Author(s):  
F. Hang ◽  
X. Wang
Keyword(s):  
1987 ◽  
Vol 1 (1) ◽  
pp. 33-46 ◽  
Author(s):  
David Aldous

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.


2018 ◽  
Vol 293 (1-2) ◽  
pp. 485-502 ◽  
Author(s):  
Daguang Chen ◽  
Fang Wang ◽  
Xiao Zhang

2017 ◽  
Vol 67 (2) ◽  
pp. 765-784
Author(s):  
Fida El Chami ◽  
Georges Habib ◽  
Ola Makhoul ◽  
Roger Nakad

2009 ◽  
Vol 137 (07) ◽  
pp. 2299-2309 ◽  
Author(s):  
Jesse Ratzkin ◽  
Andrejs Treibergs
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document