Babai, L. (1991) Local expansion of vertex-transitive graphs and random generation in finite groups. Proc. 23rd Annual ACM Symposium on Theory of Computing: STOC 1991, pp. 164–174.
Diaconis, P. and Fill, J. (1990) Strong stationary times via a new form of duality. Ann. Probab. 18 1483–1522.
Diaconis, P. and Saloff-Coste, L. (1993) Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730.
Diaconis, P. and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36–61.
Dyer, M., Goldberg, L., Jerrum, M. and Martin, R. (2006) Markov chain comparison. Probab. Surv. 3 89–111.
Fill, J. (1991) Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1 62–87.
Greenhill, C. (2013) Making Markov chains less lazy. arXiv:1203.6668
Jerrum, M. and Sinclair, A. (1988) Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved. In Proc. 20th Annual ACM Symposium on Theory of Computing: STOC 1988, pp. 235–243.
Kannan, R., Lovász, L. and Montenegro, R. (2006) Blocking conductance and mixing in random walks. Combin. Probab. Comput. 15 541–570.
Lawler, G. and Sokal, A. (1988) Bounds on the l 2 spectrum for Markov chains and Markov processes: A generalization of Cheeger's inequality. Trans. Amer. Math. Soc. 309 557–580.
Mihail, M. (1989) Conductance and convergence of Markov chains: A combinatorial treatment of expanders. In 30th Annual Symposium on Foundations of Computer Science, pp. 526–531.
Montenegro, R. and Tetali, P. (2006) Mathematical Aspects of Mixing Times in Markov Chains, Vol. 1:3 of Foundations and Trends in Theoretical Computer Science, NOW Publishers.
Morris, B. and Peres, Y. (2005) Evolving sets, mixing and heat kernel bounds. Probab. Theory Rel. Fields 133 245–266.
Sinclair, A. (1992) Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1 351–370.