The 'Burnside process' converges slowly

Combinatorics Probability and Computing

Volumn 11, Issue 1, 2002, Pages 21-34

  Goldberg, Leslie Ann ^a   Jerrum, Mark ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBLEM SOLVING; SAMPLING; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPH; BURNSIDE PROCESS; GIBBS DISTRIBUTION; PERMUTATION GROUPS; SWENDSEN-WANG PROCESS;

GRAPH THEORY;

EID: 0036003903     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830100493X     Document Type: Article

References (17)

1. Besag, J. and Green, P. (1993) Spatial statistics and Bayesian computation. J. Royal Statist. Soc. B 55 25-37 (See also the 'Discussion on the Gibbs sampler and other MCMC methods' on pp. 53-102.)
2. Bollobás, B., Grimmett, G. and Janson, S. (1996) The random-cluster model on the complete graph. Probab. Theory Rel. Fields 104 283-317.
3. de Bruijn, N. G. (1964) Pólya's theory of counting. In Applied Combinatorial Mathematics (E. F. Beckenbach, ed.), Wiley, pp. 144-184.
4. Edwards, R. G. and Sokal, A. D. (1988) Generalizations of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Phys. Review D 38 2009-2012.
5. Goldberg, L. A. (1993) Automating Pólya theory: The computational complexity of the cycle index polynomial. Inform. Comput. 105 268-288.
6. Gore, V. and Jerrum, M. (1997) The Swendsen-Wang process does not always mix rapidly. In Proc. 29th ACM Symposium on Theory of Computation (STOC), ACM Press, pp. 674-681. (Theorem numbers cited here are from the proceedings version, not from the Edinburgh University technical report version (ECS-LFCS-96-349, 1996).)
7. Jaeger, F., Vertigan, D. L. and Welsh, D. J. A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108 35-53.
8. Jerrum, M. (1993) Uniform sampling modulo a group of symmetries using Markov chain simulation. In Expanding Graphs (J. Friedman, ed.), Vol. 10 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 37-47.
9. Jerrum, M. (1995) Computational Pólya theory In Surveys in Combinatorics 1995, Vol. 218 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 103-118.
10. Jerrum, M. and Sinclair, A. (1986) The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems (D. Hochbaum, ed.) PWS, pp. 482-520.
11. Luks, E. M. (1982) Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25 42-65.
12. McDiarmid, C. (1989) On the method of bounded differences. In Vol. 141 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 148-188.
13. Martin, P. (1991) Potts Models and Related Problems in Statistical Mechanics, World Scientific, Singapore.
14. Neumann, P. M. (1979) A lemma that is not Burnside's. Mathematical Scientist 4 133-141.
15. O'Connell, N. (1998) Some large deviation results for sparse random graphs. Probab. Theory Rel. Fields 110 277-285.
16. Soicher, L. Personal communication.
17. Wormald, N. C. (1987) Generating random unlabelled graphs. SIAM J. Comput. 16 717-727.