Random walks and the effective resistance of networks
暂无分享,去创建一个
In this article we present an interpretation ofeffective resistance in electrical networks in terms of random walks on underlying graphs. Using this characterization we provide simple and elegant proofs for some known results in random walks and electrical networks. We also interpret the Reciprocity theorem of electrical networks in terms of traversals in random walks. The byproducts are (a) precise version of thetriangle inequality for effective resistances, and (b) an exact formula for the expectedone-way transit time between vertices.
[1] J. Kemeny,et al. Denumerable Markov chains , 1969 .
[2] William H. Hayt,et al. Engineering Circuit Analysis , 1971 .
[3] F. Göbel,et al. Random walks on graphs , 1974 .
[4] J. Laurie Snell,et al. Random Walks and Electrical Networks , 1984 .
[5] Prabhakar Raghavan,et al. The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.