{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:10:06Z","timestamp":1746346206697,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_31","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T10:43:15Z","timestamp":1408185795000},"page":"371-381","source":"Crossref","is-referenced-by-count":2,"title":["Switching Colouring of G(n,d\/n) for Sampling up to Gibbs Uniqueness Threshold"],"prefix":"10.1007","author":[{"given":"Charilaos","family":"Efthymiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Coja-Oghlan, A.: Algorithmic Barriers from Phase Transitions. In: Proc. of FOCS 2008, pp. 793\u2013802 (2008)","DOI":"10.1109\/FOCS.2008.11"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BFb0068322","volume-title":"S\u00e9minaire de Probabilit\u00e9s XVII 1981\/82","author":"D. Aldous","year":"1983","unstructured":"Aldous, D.: Random walks of finite groups and rapidly mixing Markov chains. In: S\u00e9minaire de Probabilit\u00e9s XVII 1981\/82, pp. 243\u2013297. Springer, Heidelberg (1983)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1214\/aop\/1176988728","volume":"22","author":"J. Berg van den","year":"1994","unstructured":"van den Berg, J., Maes, C.: Disagreement percolation in the study of Markov fields. Annals of Probability\u00a022, 749\u2013763 (1994)","journal-title":"Annals of Probability"},{"key":"31_CR4","first-page":"450","volume":"29","author":"M. Dyer","year":"2006","unstructured":"Dyer, M., Flaxman, A., Frieze, A.M., Vigoda, E.: Random colouring sparse random graphs with fewer colours than the maximum degree. Journal R.S.A.\u00a029, 450\u2013465 (2006)","journal-title":"Journal R.S.A."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Dyer, M., Frieze, A.M., Hayes, A., Vigoda, E.: Randomly colouring constant degree graphs. In: Proc. of 45th FOCS, pp. 582\u2013589 (2004)","DOI":"10.1109\/FOCS.2004.57"},{"key":"31_CR6","unstructured":"Efthymiou, C.: Switching colouring of G(n,d\/n) for sampling up to Gibbs Uniqueness Threshold. Technical Report on arxiv.org"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Efthymiou, C.: MCMC sampling colourings and independent sets of G(n, d\/n) near uniqueness threshold. In: Proc. of SODA 2014, pp. 305\u2013316 (2014)","DOI":"10.1137\/1.9781611973402.22"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Efthymiou, C.: A simple algorithm for random colouring G(n, d\/n) using (2\u2009+\u2009\u03b5)d colours. In: Proc. of SODA 2012, pp. 272\u2013280 (2012)","DOI":"10.1137\/1.9781611973099.25"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0167-7152(02)00054-8","volume":"57","author":"J. Jonasson","year":"2001","unstructured":"Jonasson, J.: Uniqueness of Uniform Random Colorings of Regular Trees. Statistics & Probability Letters\u00a057, 243\u2013248 (2001)","journal-title":"Statistics & Probability Letters"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Janson, S., Luczak, T., Ruci\u0144ski, A.: Random graphs. Wiley and Sons, Inc. (2000)","DOI":"10.1002\/9781118032718"},{"key":"31_CR11","unstructured":"Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method:an approach to approximate counting and integration. In: Dorit, H. (ed.) Approximation Algorithms for NP-Hard Problems. PWS (1996)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Molloy, M.: The freezing threshold for k-colourings of a random graph. In: Proc. of the 44th ACM Symposium on Theory of Computing (STOC 2012), pp. 921\u2013930 (2012)","DOI":"10.1145\/2213977.2214060"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Mossel, E., Sly, A.: Gibbs Rapidly Samples Colorings of G n,d\/n . Journal Probability Theory and Related Fields\u00a0148(1-2) (2010)","DOI":"10.1007\/s00440-009-0222-x"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Vigoda, E.: Improved bounds for sampling colorings. Journal of Mathematical Physics\u00a041(3), 1555\u20131569 (2000); A preliminary version appears in FOCS 1999","DOI":"10.1063\/1.533196"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T07:34:15Z","timestamp":1746344055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}