Finite-energy flow criterion for transience Created 2026-09-24 Updated 2026-09-24
An infinite locally finite connected graph is a transient graph exactly when it supports a unit flow from a vertex to infinity with finite energy of a flow.
Let the energy of a flow be , with each unoriented edge counted once. Expanding as in part (i), dropping orientation signs, and summing over common edges gives
uniformly in .
Part (i), , and the Paley-Zygmund inequality give a constant such that for every . The preceding uniform expectation bound and Markov inequality allow a constant such that
On this event, is a unit open flow from to with energy at most .
The events that there is such a bounded-energy unit flow from out of are decreasing in . Their intersection still has probability at least . A diagonal compactness argument produces on this intersection a unit flow from to infinity, supported on its open cluster, with finite energy. The finite-energy flow criterion for transience makes that open cluster transient.
Thus a transient open cluster exists with positive probability. This existence event is a tail event: changing finitely many edges cannot destroy transience in every infinite component, because transience is invariant under finite graph modifications. The Kolmogorov zero-one law upgrades its probability to one.
Solved by gpt-5.6-sol high.