An Electrical-Network Proof of Pólya’s Theorem and Its Robustness
Aliakpar Alibi
26/10/2026
This paper presents a unified exposition of the electrical-network proof of Pólya’s theorem and examines the robustness of recurrence and transience under modifications of the underlying graph. The paper does not claim a new proof of Pólya’s theorem; its contribution is expository: the principal infinite-network tools are stated precisely enough to support the proof, and the transience argument is given through the random-ray construction of Lyons and Peres. Recurrence in one and two dimensions is obtained from the Nash-Williams criterion and explicit families of cutsets. For d≥3, Rayleigh monotonicity reduces the problem to Z^{3}, where a uniformly random ray is approximated by a simple lattice path staying within bounded distance of the ray. Averaging the corresponding path flows produces a genuine unit flow to infinity, and a geometric estimate shows that its energy is finite. The final sections discuss bounded-range modifications, diagonal edges, rough equivalence, and supercritical percolation clusters, illustrating how the electrical viewpoint extends beyond the exact symmetry of Z^{d}.
