Book2002
Reversible Markov Chains and Random Walks on Graphs
David Aldous & James Allen Fill
Collects the spectral, coupling and electrical-network methods for bounding how fast a Markov chain converges to equilibrium, treating a graph's random walk and its resistor-network analogue as one problem throughout.
link checked 17 Sept 2026FreeIntermediate