Transfer-current theorem (source code)

= Transfer-current theorem
{wiki}

In a finite <connected graph> with unit <electrical resistance> on each <edge>, choose distinct undirected <edges> $e_1,\ldots,e_k$ and orient each once. Define the <transfer current> $K(e,f)$ as the signed <electric current> through $f$ when one unit of <electric current> enters the tail of $e$ and leaves its head. For a <uniform spanning tree> $T$,
$$
\Pr(e_1,\ldots,e_k\in T)=\det[K(e_i,e_j)]_{i,j=1}^k.
$$
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 $K$ symmetric. The two-edge case therefore gives
$$
\operatorname{Cov}(1_{e\in T},1_{f\in T})=-K(e,f)^2\leq0\qquad(e\ne f).
$$
Thus <edge> inclusions are negatively correlated.<Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings via Transfer-Impedances by Robert Burton and Robin Pemantle>[Theorem1.1 and section4, transfer-impedance determinants]{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.