{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:37:00Z","timestamp":1758267420311},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_11","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"108-119","source":"Crossref","is-referenced-by-count":12,"title":["Stopping Times, Metrics and Approximate Counting"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Bordewich","sequence":"first","affiliation":[]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","first-page":"243","volume-title":"S\u00e9minaire de Probabilit\u00e9s XVII","author":"D. Aldous","year":"1983","unstructured":"Aldous, D.: Random walks on finite groups and rapidly mixing Markov chains. In: S\u00e9minaire de Probabilit\u00e9s XVII, pp. 243\u2013297. Springer, Heidelberg (1983)"},{"key":"11_CR2","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT, Elec. Coll. on Comp. Compl., ECCC TR03-049 (2003)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11537311_3","volume-title":"Fundamentals of Computation Theory","author":"M. Bordewich","year":"2005","unstructured":"Bordewich, M., Dyer, M., Karpinski, M.: Path coupling using stopping times. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 19\u201331. Springer, Heidelberg (2005) (A full version of the paper appears as http:\/\/arxiv.org\/abs\/math.PR\/0501081 )"},{"key":"11_CR4","unstructured":"Bordewich, M., Dyer, M., Karpinski, M.: Metric construction, stopping times and path coupling (2005), http:\/\/arxiv.org\/abs\/math.PR\/0511202"},{"key":"11_CR5","first-page":"248","volume-title":"Proc. 8th ACM-SIAM Symp. on Discrete Algorithms","author":"R. Bubley","year":"1997","unstructured":"Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pp. 248\u2013257. SIAM, Philadelphia (1997)"},{"key":"11_CR6","first-page":"223","volume-title":"Proc. 38th IEEE Symp. on Foundations of Computer Science","author":"R. Bubley","year":"1997","unstructured":"Bubley, R., Dyer, M.: Path coupling: A technique for proving rapid mixing in Markov chains. In: Proc. 38th IEEE Symp. on Foundations of Computer Science, pp. 223\u2013231. IEEE, Los Alamitos (1997)"},{"key":"11_CR7","unstructured":"Bubley, R., Dyer, M.: Faster random generation of linear extensions. In: Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pp. 350\u2013354. ACM-SIAM (1998)"},{"key":"11_CR8","first-page":"77","volume":"2","author":"W. Doeblin","year":"1938","unstructured":"Doeblin, W.: Expos\u00e9 de la th\u00e9orie des cha\u00eenes simples constantes de Markoff \u00e0 un nombre fini d\u2019\u00e9tats. Revue Math\u00e9matique de l\u2019Union Interbalkanique\u00a02, 77\u2013105 (1938)","journal-title":"Revue Math\u00e9matique de l\u2019Union Interbalkanique"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/rsa.10087","volume":"23","author":"M. Dyer","year":"2003","unstructured":"Dyer, M., Frieze, A.: Randomly colouring graphs with lower bounds on girth and maximum degree. Random Structures and Algorithms\u00a023, 167\u2013179 (2003)","journal-title":"Random Structures and Algorithms"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/FOCS.2004.57","volume-title":"Proc. 45th IEEE Symp. on Foundations of Computer Science","author":"M. Dyer","year":"2004","unstructured":"Dyer, M., Frieze, A., Hayes, T., Vigoda, E.: Randomly coloring constant degree graphs. In: Proc. 45th IEEE Symp. on Foundations of Computer Science, pp. 582\u2013589. IEEE, Los Alamitos (2004)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1137\/S0097539700372708","volume":"30","author":"M. Dyer","year":"2001","unstructured":"Dyer, M., Goldberg, L., Greenhill, C., Jerrum, M., Mitzenmacher, M.: An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM Journal on Computing\u00a030, 1962\u20131975 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR12","series-title":"London Math. Soc. Lecture Note Series","first-page":"101","volume-title":"Surveys in Combinatorics","author":"M. Dyer","year":"1999","unstructured":"Dyer, M., Greenhill, C.: Random walks on combinatorial objects. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics. London Math. Soc. Lecture Note Series, vol.\u00a0267, pp. 101\u2013136. Cambridge University Press, Cambridge (1999)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/jagm.1999.1071","volume":"35","author":"M. Dyer","year":"2000","unstructured":"Dyer, M., Greenhill, C.: On Markov chains for independent sets. Journal of Algorithms\u00a035, 17\u201349 (2000)","journal-title":"Journal of Algorithms"},{"key":"11_CR14","unstructured":"Hayes, T., Vigoda, E.: Variable length path coupling. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp. 103\u2013110. ACM-SIAM (2004)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M. Jerrum","year":"1995","unstructured":"Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structure & Algorithms\u00a07, 157\u2013165 (1995)","journal-title":"Random Structure & Algorithms"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Counting, sampling and integrating: algorithms and complexity, ETH Z\u00fcrich Lectures in Mathematics, Birkh\u00e4user, Basel (2003)","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<229::AID-RSA3>3.0.CO;2-X","volume":"15","author":"M. Luby","year":"1999","unstructured":"Luby, M., Vigoda, E.: Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures & Algorithms\u00a015, 229\u2013241 (1999)","journal-title":"Random Structures & Algorithms"},{"key":"11_CR18","unstructured":"Mitzenmacher, M., Niklova, E.: Path coupling as a branching process (2002)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02199113","volume":"86","author":"J. Salas","year":"1997","unstructured":"Salas, J., Sokal, A.: Absence of phase transition for anti-ferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Stat. Phys.\u00a086, 551\u2013579 (1997)","journal-title":"J. Stat. Phys."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1063\/1.533196","volume":"41","author":"E. Vigoda","year":"1999","unstructured":"Vigoda, E.: Improved bounds for sampling colorings. J. Math. Phys.\u00a041, 1555\u20131569 (1999)","journal-title":"J. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:41Z","timestamp":1619507981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11786986_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}