Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Markov chain mixing time
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/Mixing_(mathematics)/ttsAJCID">Mixing (mathematics)</a> for a formal definition of mixing</li></ul> <ul><li>Aldous, David; Fill, Jim, <a href="https://web.archive.org/web/20040921020230/http://stat-www.berkeley.edu/users/aldous/RWG/book.html"><i>Reversible Markov Chains and Random Walks on Graphs</i></a>, archived from <a href="http://stat-www.berkeley.edu/users/aldous/RWG/book.html">the original</a> on 2004-09-21.</li> <li><a href="/facts/Dave_Bayer/qYyL7nIh">Bayer, Dave</a>; <a href="/facts/Persi_Diaconis/AsI5mBLp">Diaconis, Persi</a> (1992), <a href="http://statweb.stanford.edu/%7Ecgates/PERSI/papers/bayer92.pdf">"Trailing the dovetail shuffle to its lair"</a> (PDF), <i>The Annals of Applied Probability</i>, 2 (2): 294–313, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1214%2Faoap%2F1177005705">10.1214/aoap/1177005705</a>, <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/2959752">2959752</a>, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1161056">1161056</a>.</li> <li>Jerrum, Mark (1995), "A very simple algorithm for estimating the number of k-colorings of a low-degree graph", <i>Random Structures & Algorithms</i>, 7 (2): 157–165, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1002%2Frsa.3240070205">10.1002/rsa.3240070205</a>, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1369061">1369061</a>.</li> <li>Levin, David A.; <a href="/facts/Yuval_Peres/fmtvEehr">Peres, Yuval</a>; <a href="/facts/Elizabeth_Wilmer/X2YakWg0">Wilmer, Elizabeth L.</a> (2009), <a href="/facts/Markov_Chains_and_Mixing_Times/SYmxqzhN"><i>Markov chains and mixing times</i></a>, Providence, Rhode Island: American Mathematical Society, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-8218-4739-8, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=2466937">2466937</a>.</li> <li>Sinclair, Alistair (1993), <i>Algorithms for random generation and counting: A Markov chain approach</i>, Progress in Theoretical Computer Science, Birkhäuser Boston, Inc., Boston, MA, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-1-4612-0323-0">10.1007/978-1-4612-0323-0</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-8176-3658-7, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1201590">1201590</a>.</li></ul>