Abstract
Building on a probabilistic proof of Foster’s first formula given by Tetali (1994), we prove an elementary identity for the expected hitting times of an ergodic N-state Markov chain which yields as a corollary Foster’s second formula for electrical networks, namely
where R ij is the effective resistance, as computed by means of Ohm’s law, measured across the endpoints of two adjacent edges (i,v) and (i,v), C iv and C iv are the conductances of these edges, C v is the sum of all conductances emanating from the common vertex v, and the sum on the left hand side of (1) is taken over all adjacent edges. We show how to extend Foster’s first and second formulas. As an application, we show how to use a “third formula” to compute the Kirchhoff index of a class of graphs with diameter 3.
Similar content being viewed by others
References
B. Bollobás, Modern Graph Theory, Springer: New York, 1998.
A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari, “The electrical resistance of a graph captures its commute and cover times,” In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, pp. 574–586, 1989.
A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-regular graphs, Springer: Berlin, 1989.
D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, “Random walks on weighted graphs and applications to online algorithms,” In Proceedings of the 22nd Symposium on the Theory of Computing, pp. 369–378, 1990.
P. G. Doyle and J. L. Snell, Random walks and electrical networks, The Mathematical Association of America: Washington, D.C., 1984.
R. M. Foster, “The average impedance of an electrical network,” In Contributions to Applied Mechanics (Reissner Aniversary Volume); Edwards Brothers, Ann Arbor, MI, pp. 333–340, 1949.
R. M. Foster, “An extension of a network theorem,” IRE Transactions on Circuit Theory vol. 8 pp. 75–76, 1961.
D. Klein and M. Randić, “Resistance distance,” Journal of Mathematical Chemistry vol. 12 pp. 81–95, 1993.
J. L. Palacios, “Resistance distance in graphs and random walks,” International Journal of Quantum Chemistry vol. 81 pp. 29–33, 2001a.
J. L. Palacios, “Closed-form formulas for Kirchhoff index,” International Journal of Quantum Chemistry vol. 81 pp. 135–140, 2001b.
P. Tetali, “Random walks and the effective resistance of networks,” Journal of Theoretical Probability vol. 4 pp. 101–109, 1991.
P. Tetali, “An extension of Foster's network theorem,” Combinatories, Probability and Computing vol. 3 pp. 421–427, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Palacios, J.L. Foster's Formulas via Probability and the Kirchhoff Index. Methodology and Computing in Applied Probability 6, 381–387 (2004). https://doi.org/10.1023/B:MCAP.0000045086.76839.54
Issue Date:
DOI: https://doi.org/10.1023/B:MCAP.0000045086.76839.54