{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:42:52Z","timestamp":1774053772935,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,4,30]],"date-time":"2017-04-30T00:00:00Z","timestamp":1493510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC grants \u201cComputational Counting\u201d","award":["refs. EP\/I011935\/1 and EP\/I012087\/1"],"award-info":[{"award-number":["refs. EP\/I011935\/1 and EP\/I012087\/1"]}]},{"name":"\u201cRandomized algorithms for computer networks\u201d","award":["refs. EP\/M004953\/1"],"award-info":[{"award-number":["refs. EP\/M004953\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2017,4,30]]},"abstract":"<jats:p>We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We ask: for which hereditary classes of graphs is the Markov chain ergodic and for which is it rapidly mixing? We provide a precise answer to the ergodicity question and close bounds on the mixing question. We show for the first time that the mixing time of the switch chain is polynomial in the case of monotone graphs, a class that includes examples of interest in the statistical setting.<\/jats:p>","DOI":"10.1145\/2822322","type":"journal-article","created":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T14:55:23Z","timestamp":1493650523000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Switch Markov Chain for Perfect Matchings"],"prefix":"10.1145","volume":"64","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[{"name":"University of Leeds, UK"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[{"name":"Queen Mary University of London, UK"}]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"University of Leeds, UK"}]}],"member":"320","published-online":{"date-parts":[[2017,4,30]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Reversible Markov Chains and Random Walks on Graphs.","author":"Aldous David","year":"2014"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050644033"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_21"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2006.164.51"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00221-3"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/lnms\/1215090070"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780643"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1999.10474187"},{"key":"e_1_2_1_12_1","volume-title":"A natural generalization of bounded tree-width and bounded clique-width. CoRR abs\/1402.1810","author":"F\u00fcrer Martin","year":"2014"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800140304"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/984029"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/2323971"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.37236\/1284"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_2_1_21_1","first-page":"89","article-title":"The mountain climbers\u2019 problem","volume":"117","author":"Keleti Tams","year":"1993","journal-title":"Proc. Am. Math. Soc."},{"key":"e_1_2_1_23_1","volume-title":"Wilmer","author":"Levin David A.","year":"2006"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000100050069"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216057"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11409-0_26"},{"key":"e_1_2_1_28_1","unstructured":"Igor Pak. 2010. Lectures on Discrete and Polyhedral Geometry. (2010). Retrieved from http:\/\/www.math.ucla.edu\/&sim;pak\/book.htm  Igor Pak. 2010. Lectures on Discrete and Polyhedral Geometry. (2010). Retrieved from http:\/\/www.math.ucla.edu\/&sim;pak\/book.htm"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000390"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191197210"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(87)80003-3"},{"key":"e_1_2_1_32_1","volume-title":"American Mathematical Soc.","author":"Spinrad Jeremy","year":"2003"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90019-6"},{"key":"e_1_2_1_34_1","volume-title":"The parallel climbers puzzle. Math Horizons (Nov","author":"Tucker Alan","year":"1995"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_85"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_2_1_37_1","volume-title":"Introduction to Graph Theory","author":"West Douglas B.","year":"2001","edition":"2"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-087-x"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2822322","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2822322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:31Z","timestamp":1750225711000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2822322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,30]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4,30]]}},"alternative-id":["10.1145\/2822322"],"URL":"https:\/\/doi.org\/10.1145\/2822322","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,30]]},"assertion":[{"value":"2015-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-04-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}