An interlacing technique for spectra of random walks and its application to finite percolation clusters

Florian Sobieczky

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature…