1. Random walks of finite groups and rapidly mixing Markov chains;Aldous,1983
2. Randomized Algorithms: Approximation, Generation and Counting;Bubley,2001
3. R. Bubley, M.Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, in: Proc. 38th Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 223–231
4. P. Creed, Sampling Eulerian orientations of the triangle, Preprint
5. Exposé de la théorie des chaînes simples constantes de Markoff à un nombre fini d'états;Doeblin;Revue Mathématique de l'Union Interbalkanique,1938