Damped random walks and the characteristic polynomial of the weighted Laplacian on a graph

Madhav Desai, Hariharan Narayanan

For $\lambda >0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda }{1+\lambda }$, otherwise…