For every truncated directed path , let be its signed unit flow along its traversed edges. Its divergence of a flow is zero at every vertex other than , while its strength from to is one. The displayed expression in the question isIt is a nonnegative linear combination of such path flows. Hence it obeys flow conservation at every interior vertex, is antisymmetric on oppositely directed edges, and is supported on open edges. It is therefore a flow from to for every configuration .
The strength of the linear combination is the same linear combination of the unit strengths:Taking expectations cancels each denominator. Since the truncated paths partition the path space,
Expanding the square and using the independence of the percolation edges givesThe ratio equals , where is the number of common edges in the two truncated paths. It is at most for , under the convention in the hypothesis; in particular because both paths contain . For every integer ,The tail-sum formula and the assumed exponential intersection tail therefore yield
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 givesuniformly 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 thatOn 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.
Articles by others on the same topic
There are currently no matching articles.