{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:34:15Z","timestamp":1729636455649,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238175","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"4-15","source":"Crossref","is-referenced-by-count":1,"title":["Mixing [Markov chain]"],"prefix":"10.1109","author":[{"given":"D.","family":"Randall","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF02199113"},{"key":"ref32","first-page":"959s","article-title":"Sampling Spin Configurations of an Ising System","author":"randall","year":"1999","journal-title":"Proc ACM\/SIAM Symposium on Discrete Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1063\/1.533199"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_8"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90067-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0323-0"},{"key":"ref35","first-page":"1","article-title":"Convergence rates for Monte Carlo experiments. Numerical Methods for Polymeric Systems","author":"sinclair","year":"1997","journal-title":"IMA Volumes in Mathematics and its Applications"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000390"},{"key":"ref10","first-page":"26","article-title":"A random polynomial time algorithm for approximating the volume of a convex body","author":"dyer","year":"1992","journal-title":"Proc 24th ACM Symp on Theory of Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700372708"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<285::AID-RSA6>3.0.CO;2-R"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238234"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070205"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"ref16","first-page":"482","article-title":"The Markov chain Monte Carlo method: an approach to approximate counting and integration","author":"jerrum","year":"1997","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380877"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"ref28","first-page":"91","article-title":"The Glauber dynamics on colorings of a graph with high girth and maximum degree","author":"molloy","year":"2002","journal-title":"Proc 34th ACM Symp on Theory of Computing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63516"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5992.814660"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2322600"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814595"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00333-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005359"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1063\/1.533194"},{"key":"ref2","article-title":"Reversible Markov chains and Random Walks on Graphs","author":"aldous","year":"2003","journal-title":"preparation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959934"},{"key":"ref1","first-page":"243","article-title":"Random walks on finite groups and rapidly mixing Markov chains","volume":"986","author":"aldous","year":"1981","journal-title":"S&#x00E9;minaire de Probabilites XVII"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365726"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799360355"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/dimacs\/041\/06","article-title":"Mixing times. Microsurveys in Discrete Probability","volume":"41","author":"lov\u00e1sz","year":"1998","journal-title":"DIMACS Series in Discrete Math and Theoretical Computer Science"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1026915617"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<229::AID-RSA3>3.0.CO;2-X"},{"key":"ref26","article-title":"Disjoint decomposition with applications to sampling circuits in some Cayley graphs","author":"martin","year":"2003","journal-title":"Preprint"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892137"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238175.pdf?arnumber=1238175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T10:23:00Z","timestamp":1524306180000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238175\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238175","relation":{},"subject":[]}}