{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:16:44Z","timestamp":1751516204778,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_59","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"820-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Rapid Mixing of k-Class Biased Permutations"],"prefix":"10.1007","author":[{"given":"Sarah","family":"Miracle","sequence":"first","affiliation":[]},{"given":"Amanda Pascoe","family":"Streib","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"59_CR1","volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"D Knuth","year":"1969","unstructured":"Knuth, D.: The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, Boston (1969)"},{"key":"59_CR2","first-page":"243","volume":"17","author":"DJ Aldous","year":"1983","unstructured":"Aldous, D.J.: Random walks on finite groups and rapidly mixing Markov chains. S\u00e9minaire de probabilit\u00e9s de Strasbourg 17, 243\u2013297 (1983)","journal-title":"S\u00e9minaire de probabilit\u00e9s de Strasbourg"},{"key":"59_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00535487","volume":"57","author":"P Diaconis","year":"1981","unstructured":"Diaconis, P., Shahshahani, M.: Generating a random permutation with random transpositions. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 57, 159\u2013179 (1981)","journal-title":"Z. Wahrscheinlichkeitstheorie Verw. Gebiete"},{"key":"59_CR4","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1214\/aop\/1176989013","volume":"21","author":"P Diaconis","year":"1993","unstructured":"Diaconis, P., Saloff-Coste, L.: Comparison techniques for random walks on finite groups. Ann. Appl. Probab. 21, 2131\u20132156 (1993)","journal-title":"Ann. Appl. Probab."},{"key":"59_CR5","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1214\/aoap\/1075828054","volume":"1","author":"D Wilson","year":"2004","unstructured":"Wilson, D.: Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 1, 274\u2013325 (2004)","journal-title":"Ann. Appl. Probab."},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Bhakta, P., Miracle, S., Randall, D., Streib, A.: Mixing times of Markov chains for self-organizing lists and biased permutations. In: Proceedings of the 24th ACM\/SIAM Symposium on Discrete Algorithms, SODA 2013, pp. 1\u201315 (2013)","DOI":"10.1137\/1.9781611973105.1"},{"key":"59_CR7","unstructured":"Fill, J.: An interesting spectral gap problem (2003, unpublished manuscript)"},{"key":"59_CR8","unstructured":"Fill, J.: Background on the gap problem (2003, unpublished manuscript)"},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1090\/S0002-9947-05-03610-X","volume":"357","author":"I Benjamini","year":"2005","unstructured":"Benjamini, I., Berger, N., Hoffman, C., Mossel, E.: Mixing times of the biased card shuffling and the asymmetric exclusion process. Trans. Am. Math. Soc. 357, 3013\u20133029 (2005)","journal-title":"Trans. Am. Math. Soc."},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/5505.5507","volume":"17","author":"JH Hester","year":"1985","unstructured":"Hester, J.H., Hirschberg, D.S.: Self-organizing linear search. Comput. Surv. 17, 295\u2013311 (1985)","journal-title":"Comput. Surv."},{"key":"59_CR11","unstructured":"Haddadan, S., Winkler, P.: Mixing of permutations by biased transposition. In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, pp. 41:1\u201341:13 (2017)"},{"key":"59_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0001-8708(70)90034-4","volume":"5","author":"F Spitzer","year":"1970","unstructured":"Spitzer, F.: Interaction of Markov processes. Adv. Math. 5, 240\u2013290 (1970)","journal-title":"Adv. Math."},{"key":"59_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539799360355","volume":"31","author":"M Luby","year":"2001","unstructured":"Luby, M., Randall, D., Sinclair, A.: Markov chain algorithms for planar lattice structures. SIAM J. Comput. 31, 167\u2013192 (2001)","journal-title":"SIAM J. Comput."},{"key":"59_CR14","doi-asserted-by":"crossref","unstructured":"Greenberg, S., Pascoe, A., Randall, D.: Sampling biased lattice configurations using exponential metrics. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009 (2009)","DOI":"10.1137\/1.9781611973068.9"},{"key":"59_CR15","unstructured":"Pascoe, A., Randall, D.: Self-assembly and convergence rates of heterogenous reversible growth processes. In: Foundations of Nanoscience (2009)"},{"key":"59_CR16","unstructured":"Labb\u00e9, C., Lacoin, H.: Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling. arXiv:1610.07383v1 (2016)"},{"key":"59_CR17","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1007\/s10955-016-1664-z","volume":"165","author":"D Levin","year":"2016","unstructured":"Levin, D., Peres, Y.: Mixing of the exclusion process with small bias. J. Stat. Phys. 165, 1036\u20131050 (2016)","journal-title":"J. Stat. Phys."},{"key":"59_CR18","unstructured":"Greenberg, S., Randall, D., Streib, A.: Sampling biased monotonic surfaces using exponential metrics (2017)"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Martin, R., Randall, D.: Sampling adsorbing staircase walks using a new Markov chain decomposition method. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 492\u2013502 (2000)","DOI":"10.1109\/SFCS.2000.892137"},{"key":"59_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S0963548305007352","volume":"15","author":"R Martin","year":"2006","unstructured":"Martin, R., Randall, D.: Disjoint decomposition of Markov chains and sampling circuits in cayley graphs. Comb. Probab. Comput. 15, 411\u2013448 (2006)","journal-title":"Comb. Probab. Comput."},{"key":"59_CR21","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting","author":"A Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting. Progress in Theoretical Computer Science. Birkh\u00e4user, Basel (1993)"},{"key":"59_CR22","unstructured":"Randall, D.: Mixing. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003)"},{"key":"59_CR23","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1214\/aoap\/1026915617","volume":"12","author":"N Madras","year":"2002","unstructured":"Madras, N., Randall, D.: Markov chain decomposition for convergence rate analysis. Ann. Appl. Probab. 12, 581\u2013606 (2002)","journal-title":"Ann. Appl. Probab."},{"key":"59_CR24","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P Diaconis","year":"1993","unstructured":"Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3, 696\u2013730 (1993)","journal-title":"Ann. Appl. Probab."},{"key":"59_CR25","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1063\/1.533199","volume":"41","author":"D Randall","year":"2000","unstructured":"Randall, D., Tetali, P.: Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys. 41, 1598\u20131615 (2000)","journal-title":"J. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:30:26Z","timestamp":1751481026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}