Abstract
We consider the problem of sampling “unlabelled structures”, i.e., sampling combinatorial structures modulo a group of symmetries. The main tool which has been used for this sampling problem is Burnside’s lemma. In situations where a significant proportion of the structures have no non-trivial symmetries, it is already fairly well understood how to apply this tool. More generally, it is possible to obtain nearly uniform samples by simulating a Markov chain that we call the Burnside process; this is a random walk on a bipartite graph which essentially implements Burnside’s lemma. For this approach to be feasible, the Markov chain ought to be “rapidly mixing”, i.e., converge rapidly to equilibrium. The Burnside process was known to be rapidly mixing for some special groups, and it has even been implemented in some computational group theory algorithms. In this paper, we show that the Burnside process is not rapidly mixing in general. In particular, we construct an infinite family of permutation groups for which we show that the mixing time is exponential in the degree of the group.
This work was supported in part by ESPRIT Projects RAND-II (Project 21726) and ALCOM-IT (Project 20244), and by EPSRC grant GR/L60982.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Besag and P. Green, Spatial statistics and Bayesian computation, J. Royal Statistical Society B 55(1) 25–37 (1993). (See also the “Discussion on the Gibbs Sampler and Other MCMC Methods” on pages 53-102.)
B. Bollobás, G. Grimmett and S. Janson, The random-cluster model on the complete graph, Probability Theory and Related Fields 104 (1996), 283–317.
N. G. de Bruijn, Pólya’s theory of counting, in Applied Combinatorial Mathematics (E. F. Beckenbach, ed.), John Wiley and Sons, 1964, 144–184.
R. G. Edwards and A. D. Sokal, Generalizations of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm, Physical Review D 38 (1988), 2009–2012.
Leslie Ann Goldberg, Automating Pólya theory: the computational complexity of the cycle index polynomial, Information and Computation 105 (1993), 268–288.
Vivek Gore and Mark Jerrum, The Swendsen-Wang process does not always mix rapidly, Proceedings of the 29th ACM Symposium on Theory of Computation (STOC), ACM Press, 1997, 674–681. (Theorem numbers cited here are from the proceedings version, not from the Edinburgh University technical report version (ECS-LFCS-96-349, 1996).)
F. Jaeger, D. L. Vertigan, and D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Mathematical Proceedings of the Cambridge Philosophical Society 108 (1990), 35–53.
Mark Jerrum, Uniform sampling modulo a group of symmetries using Markov chain simulation. In “Expanding Graphs” (Joel Friedman, ed.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 10, American Mathematical Society, 1993, 37–47.
Mark Jerrum, Computational Pólya theory. In “Surveys in Combinatorics 1995,” London Mathematical Society Lecture Note Series 218, Cambridge University Press, 1995, 103–118.
Mark Jerrum and Alistair Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems (Dorit Hochbaum, ed.), PWS, 1996, 482–520.
Eugene M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences 25 (1982), 42–65.
Colin McDiarmid, On the method of bounded differences, London Mathematical Society Lecture Note Series 141, Cambridge University Press, 1989, 148–188.
Paul Martin, Potts Models and Related Problems in Statistical Mechanics, World Scientific, Singapore, 1991.
P. M. Neumann, A lemma that is not Burnside’s, Mathematical Scientist 4 (1979), 133–141.
Neil O’Connell, Some large deviation results for sparse random graphs, Probability Theory and Related Fields 110 (1998), 277–285.
Leonard Soicher, personal communication.
N.C. Wormald, Generating random unlabelled graphs, SIAM Journal of Computing 16 (1987) 717–727.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldberg, L.A., Jerrum, M. (1998). The “Burnside Process” Converges Slowly. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive