{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:05:48Z","timestamp":1769745948455,"version":"3.49.0"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1002\/1098-2418(200101)18:1<1::aid-rsa1>3.0.co;2-7","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T01:02:04Z","timestamp":1031706124000},"page":"1-17","source":"Crossref","is-referenced-by-count":3,"title":["Coupling vs. conductance for the Jerrum-Sinclair chain"],"prefix":"10.1002","volume":"18","author":[{"given":"V.S.","family":"Anil Kumar","sequence":"first","affiliation":[]},{"given":"H.","family":"Ramesh","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB1","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BFb0068322","volume-title":"Random walks on finite groups and rapidly mixing Markov chains, S\u00e8minaire de probabilit\u00e9s XVII 1981\/82","volume":"986","author":"Aldous","year":"1983","unstructured":"Random walks on finite groups and rapidly mixing Markov chains, S\u00e8minaire de probabilit\u00e9s XVII 1981\/82, Lecture Notes in Math., vol. 986, Springer-Verlag, New York, 1983, pp. 243-297."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB2","author":"Kumar","unstructured":"and Markovian coupling vs. conductance for the Jerrum-Sinclair chain, Proc 40th Annual IEEE Symp Foundations of Computer Science, 1999, pp. 241-251."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB3.1","author":"Broder","unstructured":"How hard is it to marry at random? (On the approximation of the permanent), Proc 18th ACM Symp Theory of Computating, 1986, pp. 50-58."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB3.2","unstructured":"Erratum in Proc 20th ACM Symp Theory of Computing, 1988, p. 551."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB4","author":"Bubley","unstructured":"and Path coupling: a technique for proving rapid mixing in Markov chains, Proc 38th Ann IEEE Symp Foundations of Computer Science, 1997, pp. 223-231."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB5","author":"Bubley","unstructured":"and Faster random generation of linear extensions, Proc 9th ACM-SIAM Symp Discrete Algorithms, 1998, pp. 350-354."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<213::AID-RSA1>3.0.CO;2-Y","author":"Bubley","year":"1998","journal-title":"Random Struct Alg 12"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB7","author":"Burdzy","year":"1998","unstructured":"and Efficient Markovian couplings: examples and counter examples, Research Report 331, University of Warwick, Dept. of Statistics, 1998."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB8","author":"Czumaj","unstructured":"and Delayed path coupling and generating random permutations via distributed stochastic processes, Proc 10th ACM-SIAM Symp Discrete Algorithms, 1999, pp. 271-280."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB9","doi-asserted-by":"crossref","DOI":"10.1214\/lnms\/1215467407","volume-title":"Group representations in probability and statistics","author":"Diaconis","year":"1988","unstructured":"Group representations in probability and statistics, Institute of Mathematical Statistics, 1988."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"Dyer","year":"1991","journal-title":"J ACM"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6746-2","volume-title":"Controlled Markov processes","author":"Dynkin","year":"1979","unstructured":"and Controlled Markov processes, Springer Verlag, Berlin, 1979."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00539434","volume":"31","author":"Griffeath","year":"1975","journal-title":"Z. Wahrscheinlichkeitstheorie Verw"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB13","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1017\/S0001867800020619","volume":"14","author":"Hajek","year":"1982","journal-title":"Adv Appl Probab"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"Jerrum","year":"1995","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB15","series-title":"Algo. Combin","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/978-3-662-12788-9_4","volume-title":"Probabilistic methods for algorithmic discrete mathematics","volume":"19","author":"Jerrum","year":"1998","unstructured":"Mathematical foundations of the Markov chain Monte Carlo method, Probabilistic methods for algorithmic discrete mathematics ( eds.), Algo. Combin vol. 19, Springer Verlag, New York, 1998, pp. 116-165."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB16","author":"Jerrum","year":"1991","unstructured":"An analysis of a Monte Carlo algorithm for estimating the permanent, Technical Report ECS-LFCS-91-164, Dept. of Computer Science, Univ. of Edinburg, 1991."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB17","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"Jerrum","year":"1989","journal-title":"SIAM J Comput"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB18","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0222066","volume":"22","author":"Jerrum","year":"1993","journal-title":"SIAM J Comput"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB19","author":"Kannan","unstructured":"Markov chains and polynomial time algorithms, Proc 35th Ann IEEE Symp Foundations of Computer Science, 1994, pp. 656-671."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB20","volume-title":"Lectures on the coupling method","author":"Lindvall","year":"1992","unstructured":"Lectures on the coupling method, Wiley, New York, 1992."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"Lovasz","year":"1993","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB22","author":"Luby","unstructured":"and Approximately counting up to four, Proc 29th ACM Symp Theory of Computating, 1997, pp. 682-687."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90115-4","volume":"30","author":"Mihail","year":"1989","journal-title":"Inform Process Lett"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB24","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/1037083","volume":"37","author":"Rosenthal","year":"1995","journal-title":"SIAM Rev"},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB25","volume-title":"Randomised algorithms for counting and generating combinatorial structures","author":"Sinclair","year":"1993","unstructured":"Randomised algorithms for counting and generating combinatorial structures, Birkh\u00e4user, Zurich, 1993."},{"key":"10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7-BIB26","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/42282.46160","volume":"35","author":"Sasaki","year":"1988","journal-title":"J ACM"}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1098-2418(200101)18:1%3C1::AID-RSA1%3E3.0.CO;2-7","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1098-2418(200101)18:1%3C1::AID-RSA1%3E3.0.CO;2-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T22:55:52Z","timestamp":1703890552000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"URL":"https:\/\/doi.org\/10.1002\/1098-2418(200101)18:1<1::aid-rsa1>3.0.co;2-7","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}