{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:41:08Z","timestamp":1725536468209},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_47","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T22:39:51Z","timestamp":1250807991000},"page":"631-645","source":"Crossref","is-referenced-by-count":5,"title":["The Glauber Dynamics for Colourings of Bounded Degree Trees"],"prefix":"10.1007","author":[{"given":"Brendan","family":"Lucier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Molloy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Peres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00440-004-0369-4","volume":"131","author":"N. Berger","year":"2005","unstructured":"Berger, N., Kenyon, C., Mossel, E., Peres, Y.: Glauber dynamics on trees and hyperbolic graphs. Prob. Th. Related Fields\u00a0131, 311\u2013340 (2005)","journal-title":"Prob. Th. Related Fields"},{"key":"47_CR2","unstructured":"Brightwell, G., Winkler, P.: Random colorings of a Cayley tree. In: Bollob\u00e1s, B. (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies, vol.\u00a010, pp. 247\u2013276 (2002)"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P. Diaconis","year":"1993","unstructured":"Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Ann. Appl. Prob.\u00a03, 696\u2013730 (1993)","journal-title":"Ann. Appl. Prob."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1214\/aoap\/1177005980","volume":"1","author":"P. Diaconis","year":"1991","unstructured":"Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob.\u00a01, 36\u201361 (1991)","journal-title":"Ann. Appl. Prob."},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1214\/105051605000000683","volume":"18","author":"M. Dyer","year":"2006","unstructured":"Dyer, M., Goldberg, L., Jerrum, M.: Systematic scan for sampling colorings. Ann. Appl. Prob.\u00a018, 185\u2013230 (2006)","journal-title":"Ann. Appl. Prob."},{"key":"47_CR6","unstructured":"Goldberg, L., Jerrum, M., Karpinski, M.: The mixing time of Glauber dynamics for colouring regular trees (2008) arXiv:0806.0921v1"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Hayes, T., Vera, J., Vigoda, E.: Randomly coloring planar graphs with fewer colors than the maximum degree. In: Proceedings of STOC 2007 (2007)","DOI":"10.1145\/1250790.1250857"},{"key":"47_CR8","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-colourings of a low-degree graph. Rand. Struct. Alg.\u00a07, 157\u2013165 (1995)","journal-title":"Rand. Struct. Alg."},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. Siam. Jour. Comput.\u00a018, 1149\u20131178 (1989)","journal-title":"Siam. Jour. Comput."},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0167-7152(02)00054-8","volume":"57","author":"J. Jonasson","year":"2002","unstructured":"Jonasson, J.: Uniqueness of uniform random colourings of regular trees. Stat. & Prob. Letters\u00a057, 243\u2013248 (2002)","journal-title":"Stat. & Prob. Letters"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1515\/crll.1869.70.185","volume":"70","author":"C. Jordan","year":"1869","unstructured":"Jordan, C.: Sur les assemblages de lignes. J. Reine Angew. Math.\u00a070, 185\u2013190 (1869)","journal-title":"J. Reine Angew. Math."},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Martinelli, F.: Lectures on Glauber dynamics for discrete spin models. Lecture Notes in Mathematics, vol.\u00a01717 (2000)","DOI":"10.1007\/978-3-540-48115-7_2"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Lucier, B., Molloy, M.: The Glauber dynamics for colourings of bounded degree trees. Submitted to journal (2008)","DOI":"10.1007\/978-3-642-03685-9_47"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1002\/rsa.20132","volume":"31","author":"F. Martinelli","year":"2007","unstructured":"Martinelli, F., Sinclair, A., Weitz, D.: Fast mixing for independent sets, colorings and other models on trees. Rand. Struc. & Alg.\u00a031, 134\u2013172 (2007)","journal-title":"Rand. Struc. & Alg."},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/1098-2418(200103)18:2<101::AID-RSA1000>3.0.CO;2-D","volume":"18","author":"M. Molloy","year":"2001","unstructured":"Molloy, M.: Very rapidly mixing Markov Chains for (2 \u0394)-colourings and for independent sets in a 4-regular graph. Rand. Struc. & Alg.\u00a018, 101\u2013115 (2001)","journal-title":"Rand. Struc. & Alg."},{"key":"47_CR16","unstructured":"Mossel, E., Sly, A.: Gibbs Rapidly Samples Colourings of G(n,d\/n) (2007), http:\/\/front.math.ucdavis.edu\/0707.3241"},{"key":"47_CR17","unstructured":"Randall, D.: Mixing. In: Proceedings of FOCS 2003 (2003)"},{"key":"47_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing\u00a01, 351\u2013370 (1992)","journal-title":"Combinatorics, Probability and Computing"},{"key":"47_CR19","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1063\/1.533196","volume":"41","author":"E. Vigoda","year":"2000","unstructured":"Vigoda, E.: Improved bounds for sampling colorings. J. Math. Physics\u00a041, 1555\u20131569 (2000)","journal-title":"J. Math. Physics"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:34:02Z","timestamp":1558481642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}