{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:21:32Z","timestamp":1737436892202,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_8","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"74-86","source":"Crossref","is-referenced-by-count":2,"title":["Decomposition Methods and Sampling Circuits in the Cartesian Lattice"],"prefix":"10.1007","author":[{"given":"Dana","family":"Randall","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"C. Borgs, J. T. Chayes, A. Frieze, J. H. Kim, P. Tetali, E. Vigoda, and V. H. Vu. Torpid mixing of some MCMC algorithms in statistical physics. Proc. 40th IEEE Symposium on Foundations of Computer Science, 218\u2013229, 1999.","DOI":"10.1109\/SFFCS.1999.814594"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0012-365X(98)00333-1","volume":"201","author":"R. Bubley","year":"1999","unstructured":"R. Bubley and M. Dyer. Faster random generation of linear extensions. Discrete Mathematics, 201:81\u201388, 1999.","journal-title":"Discrete Mathematics"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"R. Bubley and M. Dyer. Path coupling: A technique for proving rapid mixing in Markov chains. Proc. 38th Annual IEEE Symposium on Foundations of Computer Science 223\u2013231, 1997.","DOI":"10.1109\/SFCS.1997.646111"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P. Diaconis","year":"1993","unstructured":"P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov chains. Annals of Applied Probability, 3:696\u2013730, 1993.","journal-title":"Annals of Applied Probability"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/jagm.1999.1071","volume":"35","author":"M. Dyer","year":"2000","unstructured":"M. Dyer and C. Greenhill. On Markov chains for independent sets. Journal of Algorithms, 35: 17\u201349, 2000.","journal-title":"Journal of Algorithms"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<285::AID-RSA6>3.0.CO;2-R","volume":"13","author":"M. Dyer","year":"1998","unstructured":"M. Dyer and C. Greenhill. A more rapidly mixing Markov chain for graph colorings. Random Structures and Algorithms, 13:285\u2013317, 1998.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR7","first-page":"156","volume-title":"Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface","author":"C. J. Geyer","year":"1991","unstructured":"C. J. Geyer Markov Chain Monte Carlo Maximum Likelihood. Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface (E. M. Keramidas, ed.), 156\u2013163. Interface Foundation, Fairfax Station, 1991."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.2307\/2291325","volume":"90","author":"C. J. Geyer","year":"1995","unstructured":"C. J. Geyer and E. A. Thompson. Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference. J. Amer. Statist. Assoc. 90 909\u2013920, 1995.","journal-title":"J. Amer. Statist. Assoc."},{"key":"8_CR9","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":"M. Luby and E. Vigoda. Fast Convergence of the Glauber dynamics for sampling independent sets. Random Structures and Algorithms 15: 229\u2013241, 1999.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1214\/aoap\/1029962870","volume":"9","author":"N. Madras","year":"1999","unstructured":"N. Madras and M. Piccioni. Importance sampling for families of distributions. Ann. Appl. Probab. 9: 1202\u20131225, 1999.","journal-title":"Ann. Appl. Probab."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"N. Madras and D. Randall. Factoring graphs to bound mixing rates. Proc. 37th Annual IEEE Symposium on Foundations of Computer Science, 194\u2013203, 1996.","DOI":"10.1109\/SFCS.1996.548478"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"N. Madras and D. Randall. Markov chain decomposition for convergence rate analysis. Annals of Applied Probability, (to appear), 2001.","DOI":"10.1214\/aoap\/1026915617"},{"key":"8_CR13","unstructured":"N. Madras and Z. Zheng. On the swapping algorithm. Preprint, 2001."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1209\/0295-5075\/19\/6\/002","volume":"19","author":"E. Marinari","year":"1992","unstructured":"E. Marinari and G. Parisi. Simulated tempering: a new Monte Carlo scheme. Europhys. Lett. 19 451\u2013458, 1992.","journal-title":"Europhys. Lett."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"R. A. Martin and D. Randall Sampling adsorbing staircase walks using a new Markov chain decomposition method. Proceedings of the 41st Symposium on the Foundations of Computer Science (FOCS 2000), 492\u2013502, 2000.","DOI":"10.1109\/SFCS.2000.892137"},{"key":"8_CR16","unstructured":"R. A. Martin and D. Randall Disjoint decomposition with applications to sampling circuits in some Cayley graphs. Preprint, 2001."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1063\/1.533199","volume":"41","author":"D. Randall","year":"2000","unstructured":"D. Randall and P. Tetali. Analyzing Glauber dynamics by comparison of Markov chains. Journal of Mathematical Physics, 41:1598\u20131615, 2000.","journal-title":"Journal of Mathematical Physics"},{"key":"8_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for random generation & counting: a Markov chain approach","author":"A. J. Sinclair","year":"1993","unstructured":"A. J. Sinclair. Algorithms for random generation & counting: a Markov chain approach. Birkh\u00e4user, Boston, 1993."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:27:52Z","timestamp":1737397672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}