Resistance distance
From Wikipedia, the free encyclopedia
In graph theory, the resistance distance between two vertices of a simple connected graph, G, is equal to the resistance between two equivalent points on an electrical network, constructed so as to correspond to G, with each edge being replaced by a 1 ohm resistance. It is a metric on graphs.
Contents |
[edit] Definition
On a graph G, the resistance distance Ωi,j between two vertices vi and vj is defined as
where Γ is the Moore-Penrose inverse of the Laplacian matrix of G.
[edit] Properties of resistance distance
If i=j then
- .
For an undirected graph
[edit] General sum rule
For any N-vertex simple connected graph G = (V, E) and arbitrary NXN matrix M:
From this generalized sum rule a number of relationships can be derived depending on the choice of M. Two of note are;
where the λk are the non-zero eigenvalues of the Laplacian matrix.
[edit] Relationship to the number of spanning trees of a graph
For a simple connected graph G = (V, E), the resistance distance between two vertices may by expressed as a function of the set of spanning trees, T, of G as follows:
where T' is the set of spanning trees for the graph G' = (V,E + ei,j).
[edit] As a squared Euclidean distance
Since the Laplacian L is symmetric and positive semi-definite, it's pseudoinverse Γ is also symmetric and positive semi-definite. Thus, there is a K such that Γ = KKT and we can write:
showing that the square root of the resistance distance corresponds to the Euclidean distance in the space spanned by K.
[edit] Classical mechanics
In classical mechanics, resistance distance is defined as the distance from the resistance (on a lever) to the fulcrum.