Self-testing algorithms for self-avoiding walks

Journal of Mathematical Physics

Volumn 41, Issue 3, 2000, Pages 1570-1584

  Randall, Dana ^a   Sinclair, Alistair ^b  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034345460     PISSN: 00222488     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.533197     Document Type: Article

References (23)

1. N. Madras and G. Slade, The Self-Avoiding Walk (Birkhäuser, Boston, 1993).
2. G. F. Lawler, Intersections of Random Walks (Birkhäuser, Boston, 1991).
3. J. M. Hammersley and K. W. Morton, "Poor man's Monte Carlo," J. R. Statistical Soc. B 16, 23-38 (1954).
4. J. M. Hammersley and D. J. A. Welsh, "Further results on the rate of convergence to the connective constant of the hypercubical lattice," Q. J. Math. 13, 108-110 (1962).
5. T. Hara and G. Slade, "Self-avoiding walk in five or more dimensions. I. The critical behaviour," Commun. Math. Phys. 147, 101-136 (1992).
6. T. Hara and G. Slade, "The lace expansion for self-avoiding walk in five or more dimensions," Rev. Math. Phys. 4, 235-327 (1992).
7. S. E. Alm, "Upper bounds for the connective constant of self-avoiding walks," Combinatorics, Probability Computing 2, 115-136 (1993).
8. A. R. Conway and A. J. Guttmann, "Lower bound on the connective constant for square lattice self-avoiding walks," J. Phys. A 26, 3719-3724 (1993).
9. T. Hara, G. Slade, and A. D. Sokal, "New lower bounds on the self-avoiding-walk connective constant," J. Stat. Phys. 72, 479-517 (1993).
10. I. Jensen and A. J. Guttmann, "Self-avoiding polygons on the square lattice," J. Phys. A 32, 4867-4876 (1999).
11. A. Berretti and A. D. Sokal, "New Monte Carlo method for the self-avoiding walk," J. Stat. Phys. 40, 483-531 (1985).
12. A. D. Sokal and L. E. Thomas, "Exponential convergence to equilibrium for a class of random walk models," J. Stat. Phys. 54, 797-828 (1989).
13. 2 spectrum for Markov chains and Markov processes: A generalization of Cheeger's inequality," Trans. Am. Math. Soc. 309, 557-589 (1988).
14. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, "Random generation of combinatorial structures from a uniform distribution," Theor. Comput. Sci. 43, 169-188 (1986).
15. R. Karp, M. Luby, and N. Madras, "Monte-Carlo approximatior algorithms for enumeration problems," J. Algorithms 10, 429-448 (1989).
16. A. J. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach (Birkhäuser, Boston, 1992).
17. M. Blum, M. Luby, and R. Rubinfeld, "Self-testing/correcting with applications to numerical problems," Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 73-83.
18. G. L. O'Brien, "Monotonicity of the number of self-avoiding walks." J. Stat. Phys. 59, 969-979 (1990).
19. M. R. Jerrum and A. J. Sinclair, "Approximating the permanent," SIAM J. Comput. 18, 1149-1178 (1989).
20. A. J. Sinclair and M. R. Jerrum, "Approximate counting, uniform generation and rapidly mixing Markov chains," Inf. Comput. 82, 93-133 (1989).
21. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of Markov chains," Ann. Appl. Probability 1, 36-61 (1991).
22. A. J. Sinclair, "Improved bounds for mixing rates of Markov chains and multicommodity flow," Combinatorics, Probability Computing 1, 351-370 (1992).
23. D. Randall, "Counting in lattices: Combinatorial problems from statistical mechanics," Ph.D. thesis, UC Berkeley, Fall 1995. Also available as Technical Report No. TR-94-055, International Computer Science Institute, Berkeley.