Aldous, D. (1983) Random walks on finite groups and rapidly mixing Markov chains. In Séminaire de Probabilités XVII, Vol. 986 of Lecture Notes in Mathematics, Springer, pp. 243–297.
Benjamini, I., Berger, N., Hoffman, C. and Mossel, E. (2005) Mixing times of the biased card shuffling and the asymmetric exclusion process. Trans. Amer. Math. Soc. 357 3013–3029.
Berger, N., Kenyon, C., Mossel, E. and Peres, Y. (2005) Glauber dynamics on trees and hyperbolic graphs. Probab. Theory Relat. Fields 131 311–340.
Bhakta, P., Miracle, S., Streib, A. and Randall, D. (2014) Mixing times of self-organizing lists and biased permutations. In 25th ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 1–15.
Bubley, R. and Dyer, M. (1999) Faster random generation of linear extensions. Discrete Math. 201 81–88.
Cannon, S., Miracle, S. and Randall, D. (2015) Phase transitions in random dyadic tilings and rectangular dissections. In 26th ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 1573–1589.
Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A. (2015) Dynamics of lattice triangulations on thin rectangles. In ACM Symposium on Theory of Computing (STOC).
Caputo, P., Martinelli, F. and Toninelli, F. (2012) Mixing times of monotone surfaces and SOS interfaces: A mean curvature approach. Commun. Math. Phys. 311 157–189.
Dyer, M. and Greenhill, C. (1998) A more rapidly mixing Markov chain for graph colorings. Random Struct. Alg. 13 285–317.
Fu, T.-J. and Seeman, N. (1993) DNA double-crossover molecules. Biochemistry 32 3211–3220.
Jerrum, M. and Sinclair, A. (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. Comput. 82 93–133.
Levin, D. and Peres, Y. (2016) Mixing of the exclusion process with small bias. J. Statist. Phys. 165 1035–1050.
Luby, M., Randall, D. and Sinclair, A. (2001) Markov chains for planar lattice structures. SIAM J. Comput. 31 167–192.
Majumder, U., Sahu, S. and Reif, J. (2008) Stochastic analysis of reversible self-assembly. J. Comput. Theoret. Nanosci. 5 1289–1305.
McShine, L. and Tetali, P. (1998) On the mixing time of the triangulation walk and other Catalan structures. In Randomization Methods in Algorithm Design, Vol. 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, pp. 147–160.
Randall, D. and Tetali, P. (2000) Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys. 41 1598–1615.
Seeman, N. (2003) DNA in a material world. Nature 421 427–431.
Wilson, D. (2004) Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 1 274–325.
Winfree, E. (1998) Simulations of computing by self-assembly. In 4th DIMACS Meeting on DNA Based Computers.
Winfree, E., Yang, X. and Seeman, N. (1996) Universal computation via self-assembly of DNA: Some theory and experiments. In DNA Based Computers II, Vol. 44 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, pp. 191–213.