{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:40:18Z","timestamp":1737078018860,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_26","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"331-345","source":"Crossref","is-referenced-by-count":0,"title":["The \u201cBurnside Process\u201d Converges Slowly"],"prefix":"10.1007","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.2517-6161.1993.tb01467.x","volume":"B 55","author":"J. Besag","year":"1993","unstructured":"J. Besag and P. Green, Spatial statistics and Bayesian computation, J. Royal Statistical Society B 55(1) 25\u201337 (1993). (See also the \u201cDiscussion on the Gibbs Sampler and Other MCMC Methods\u201d on pages 53-102.)","journal-title":"J. Royal Statistical Society"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF01213683","volume":"104","author":"B. Bollob\u00e1s","year":"1996","unstructured":"B. Bollob\u00e1s, G. Grimmett and S. Janson, The random-cluster model on the complete graph, Probability Theory and Related Fields 104 (1996), 283\u2013317.","journal-title":"Probability Theory and Related Fields"},{"unstructured":"N. G. de Bruijn, P\u00f3lya\u2019s theory of counting, in Applied Combinatorial Mathematics (E. F. Beckenbach, ed.), John Wiley and Sons, 1964, 144\u2013184.","key":"26_CR3"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1103\/PhysRevD.38.2009","volume":"38","author":"R. G. Edwards","year":"1988","unstructured":"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\u20132012.","journal-title":"Physical Review D"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/inco.1993.1045","volume":"105","author":"L. A. Goldberg","year":"1993","unstructured":"Leslie Ann Goldberg, Automating P\u00f3lya theory: the computational complexity of the cycle index polynomial, Information and Computation 105 (1993), 268\u2013288.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"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\u2013681. (Theorem numbers cited here are from the proceedings version, not from the Edinburgh University technical report version (ECS-LFCS-96-349, 1996).)","key":"26_CR6","DOI":"10.1145\/258533.258662"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F. Jaeger","year":"1990","unstructured":"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\u201353.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"doi-asserted-by":"crossref","unstructured":"Mark Jerrum, Uniform sampling modulo a group of symmetries using Markov chain simulation. In \u201cExpanding Graphs\u201d (Joel Friedman, ed.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 10, American Mathematical Society, 1993, 37\u201347.","key":"26_CR8","DOI":"10.1090\/dimacs\/010\/04"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/CBO9780511662096.006","volume":"218","author":"M. Jerrum","year":"1995","unstructured":"Mark Jerrum, Computational P\u00f3lya theory. In \u201cSurveys in Combinatorics 1995,\u201d London Mathematical Society Lecture Note Series 218, Cambridge University Press, 1995, 103\u2013118.","journal-title":"Surveys in Combinatorics 1995"},{"unstructured":"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\u2013520.","key":"26_CR10"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. M. Luks","year":"1982","unstructured":"Eugene M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences 25 (1982), 42\u201365.","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR12","first-page":"148","volume":"141","author":"C. McDiarmid","year":"1989","unstructured":"Colin McDiarmid, On the method of bounded differences, London Mathematical Society Lecture Note Series 141, Cambridge University Press, 1989, 148\u2013188.","journal-title":"London Mathematical Society Lecture Note Series"},{"key":"26_CR13","doi-asserted-by":"crossref","DOI":"10.1142\/0983","volume-title":"Potts Models and Related Problems in Statistical Mechanics","author":"P. Martin","year":"1991","unstructured":"Paul Martin, Potts Models and Related Problems in Statistical Mechanics, World Scientific, Singapore, 1991."},{"key":"26_CR14","first-page":"133","volume":"4","author":"P. M. Neumann","year":"1979","unstructured":"P. M. Neumann, A lemma that is not Burnside\u2019s, Mathematical Scientist 4 (1979), 133\u2013141.","journal-title":"Mathematical Scientist"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s004400050149","volume":"110","author":"N. O\u2019Connell","year":"1998","unstructured":"Neil O\u2019Connell, Some large deviation results for sparse random graphs, Probability Theory and Related Fields 110 (1998), 277\u2013285.","journal-title":"Probability Theory and Related Fields"},{"unstructured":"Leonard Soicher, personal communication.","key":"26_CR16"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1137\/0216048","volume":"16","author":"N.C. Wormald","year":"1987","unstructured":"N.C. Wormald, Generating random unlabelled graphs, SIAM Journal of Computing 16 (1987) 717\u2013727.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:20:23Z","timestamp":1737076823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}