1. Aldous, D., Fill, J.A.: Reversible Markov chains and random walks on graphs (2002). https://www.stat.berkeley.edu/users/aldous/RWG/book.pdf. Unfinished monograph, recompiled 2014
2. Baskerville, K., Grassberger, P., Paczuski, M.: Graph animals, subgraph sampling, and motif search in large networks. Phys. Rev. E 76(3), 036107, 13 (2007)
3. Frieze, A.: Notes on Counting and rapidly mixing Markov chains. http://www.math.cmu.edu/~af1p/Mixing.html
4. Lecture Notes in Computer Science;JA Grochow,2007
5. Guo, H., Jerrum, M.: A polynomial-time approximation algorithm for all-terminal network reliability. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, 9–13 July 2018, pp. 68:1–68:12 (2018)