In a finite connected graph with unit electrical resistance on each edge, choose distinct undirected edges and orient each once. Define the transfer current as the signed electric current through when one unit of electric current enters the tail of and leaves its head. For a uniform spanning tree ,
Reversing one orientation negates its row and column, leaving the determinant unchanged. Distinctness is necessary: repeating an edge repeats a row and gives zero, although its inclusion can have positive probability.
Electrical reciprocity makes symmetric. The two-edge case therefore gives
Thus edge inclusions are negatively correlated.[ref] The positive-weight version uses the corresponding conductance-normalized transfer current. Every extendable finite forest has positive inclusion probability, since at least one positively weighted spanning tree contains it.
In a finite connected graph with unit edge electrical resistances, orient two edges and . The transfer current is the signed current through when one unit of electric current is injected at and removed at . If is the resulting vertex potential, Ohm's law gives
where is the graph Laplacian. Potentials are determined up to an additive constant, which cancels in the difference.
On a unit-resistance triangle, injecting across one edge sends of the current along that edge and along the two-edge alternative path. Thus . The transfer-current theorem identifies this diagonal value with the probability that the edge belongs to a uniform spanning tree; exactly two of the triangle's three spanning trees contain it.
Electrical reciprocity makes the unit-resistance kernel symmetric. Reversing one edge orientation changes the appropriate sign, while the determinants giving joint tree-edge probabilities remain unchanged.[ref]
In a finite unweighted connected graph, take distinct graph vertices and orient the unique graph path from to in a uniform spanning tree and assign signed unit current to its edges. Its mean over trees is the electrical unit flow from to . The Kirchhoff node law follows by averaging graph path divergences. For the graph cycle law, let be the two-component spanning forests separating the terminals and the component containing . Deleting a tree-path edge and conversely adjoining an edge across a forest cut are inverse operations. Hence the mean signed current on an edge is
This is the gradient of , proving the graph cycle law. In particular . For an oriented existing edge , that edge is used by the tree graph path exactly when it belongs to the tree, and then has positive orientation. Thus its mean current is , giving the edge-inclusion formula for a uniform spanning tree by Ohm's law.
For a finite electrical network with positive electrical conductances , choose a spanning tree with law
The one-edge case of the transfer-current theorem gives for . A unit injected electric current produces voltage , and Ohm's law makes the electric current along equal to .
In a triangle of unit resistors, one resistor is parallel to a series pair, so . Each edge consequently has inclusion probability , also clear from the three equally likely spanning trees. For a wired uniform spanning forest, take the finite wired limit and use the limiting wired effective resistance.

Articles by others on the same topic (0)

There are currently no matching articles.