Consider an electrical network on n nodes with resistors r ij between nodes i and j . Let R ij denote the effective resistance between the nodes. Then Foster's Theorem [5] asserts that where i ∼ j denotes i and j are connected by a finite r ij . In [10] this theorem is proved by making use of random walks. The classical connection between electrical networks and reversible random walks implies a corresponding statement for reversible Markov chains. In this paper we prove an elementary identity for ergodic Markov chains, and show that this yields Foster's theorem when the chain is time-reversible. We also prove a generalization of a resistive inverse identity. This identity was known for resistive networks, but we prove a more general identity for ergodic Markov chains. We show that time-reversibility, once again, yields the known identity. Among other results, this identity also yields an alternative characterization of reversibility of Markov chains (see Remarks 1 and 2 below). This characterization, when interpreted in terms of electrical currents, implies the reciprocity theorem in single-source resistive networks, thus allowing us to establish the equivalence of reversibility in Markov chains and reciprocity in electrical networks.
[1]
P. Tetali.
Random walks and the effective resistance of networks
,
1991
.
[2]
Prasad Tetali,et al.
Design of on-line algorithms using hitting times
,
1994,
SODA '94.
[3]
R. Foster.
An Extension of a Network Theorem
,
1961
.
[4]
Peter G. Doyle,et al.
Random Walks and Electric Networks: REFERENCES
,
1987
.
[5]
M. Karonski.
Collisions among Random Walks on a Graph
,
1993
.
[6]
John G. Kemeny,et al.
Finite Markov chains
,
1960
.
[7]
J. Kemeny,et al.
Denumerable Markov chains
,
1969
.