Article,

Random Walks on Graphs : A Survey

.
Bolyai Soc. Math. Stud., (1993)

Abstract

Various aspects of the theory of random walks on graphs are surveyed. In particular, estimates on the important parameters of access time, commute time, cover time and mixing time are discussed. Connections with the eigenvalues of graphs and with electrical networks, and the use of these connections in the study of random walks is described. We also sketch recent algorithmic applications of random walks, in particular to the problem of sampling.

Tags

Users

  • @jullybobble
  • @folke

Comments and Reviews