Random Walks and Foster’s Resistance Theorem


Given any simple connected graph G =< V,E > such that each edge e ∈ E has unit resistance, Foster’s Resistance Theorem states that the summation of effective resistances over all edges equals n− 1. That is, ∑ e∈E Re = n− 1 Further, given a general graph with resistances re corresponding to edges e ∈ E, the theorem states: ∑ e∈E Re re = n− 1 Tetali[1] proved… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics