Fix an edge and orient it from to . For each spanning tree , let be its unique graph path from to . Assign a signed unit graph path flow to oriented edges: value in the direction used by , value on the reversed orientation, and zero otherwise. Define its mean
Each has net divergence one at , minus one at and zero elsewhere, so is a unit flow. The mean spanning-tree path current also satisfies the Kirchhoff cycle law. Although its verification is permitted to be omitted, a short counting argument makes it explicit. Let be the two-component spanning forests separating and , write for the component containing , and let be the number of spanning trees. Deleting an edge used by the oriented tree graph path gives one such forest. Conversely adjoining an edge across its two components gives a unique tree with that edge on its -to- graph path. Consequently
The gradient form proves the Kirchhoff cycle law directly and is Ohm's law for unit edge resistance. The Kirchhoff node law then gives , and the electrical unit flow is unique: the difference between two such voltages is a harmonic function on a graph and hence constant on the connected finite graph.
If , its single-edge route is the unique tree graph path from to , so . If , that tree graph path does not use , so . Therefore
By Ohm's law, ; for a unit terminal current, this voltage difference is exactly the effective resistance between the terminals. We have proved the requested edge-inclusion formula for a uniform spanning tree:
Now use linearity of expectation and the fact that every spanning tree has exactly edges. This gives Foster's theorem:
The sums here use unoriented edges exactly once. For unit conductance this is the displayed identity; with conductances the inclusion probability and summand become .

Articles by others on the same topic (0)

There are currently no matching articles.