Unformatted text preview: The program KRS.m , by Sungwoo Park, on the website, is an eﬃcient implementation of the second alternative. Sample results are shown in Figure 17.9. Please refer to the original paper [2] for information on how to set the parameters to KRS. Kenyon, Randall, and Sinclair showed that the algorithm samples well if both the number of steps and the interval between records are very large, but in practice the algorithm is considerably less sensitive than the analysis predicts. [1] D. Bertsimas and J. Tsitsiklis, “Simulated annealing,” Statistical Science 8(1):1015, 1993. [2] C. Kenyon, D. Randall, and A. Sinclair, “Approximating the number of monomerdimer coverings of a lattice,” J. Stat. Phys. 83(34):637659, 1996....
View
Full Document
 Fall '11
 Dr.Robin
 Equals sign, The Edge, Row, C. Kenyon

Click to edit the document details