Abstract
For , we define a -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 , otherwise continued with probability . We use the Aldous-Broder algorithm (\cite{aldous, broder}) of generating a random spanning tree and the Matrix-tree theorem to relate the values of the characteristic polynomial of the Laplacian at and the stationary measures of the sets of nodes visited by independent -damped random walks for . As a corollary, we obtain a new characterization of the non-zero eigenvalues of the Weighted Graph Laplacian.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.