Write for an edge conductance and . Take , as implicit in a unit source-to-sink electrical network. An oriented current flow is antisymmetric, . Kirchhoff's first law is conservation of current: at every vertex other than the source and sink, with the divergences there equal to the prescribed total flow and its negative. Kirchhoff's second law says that the sum of oriented voltage drops around any closed cycle is zero. Ohm's law is
Thus the resistance of an edge is , and the cycle law reads for .
Let . Its expectation is finite. Indeed, from each state there is a path to of length at most with positive probability; finiteness gives a common lower bound on reaching within that many steps. The Markov property then gives , proving the assertion. Define the expected occupation count before absorption
Conditional expectation at every pre-stopping visit to gives for the number of directed traversals. Hence the expected signed count is
This proves Ohm's law with voltage , grounded at . Summing its voltage drops along a cycle telescopes, proving Kirchhoff's second law.
For Kirchhoff's first law, count entrances and exits on each stopped path. Their net difference at is the initial indicator minus the final indicator. Taking expectations,
Thus the source emits exactly one unit, the sink receives one unit, and all other vertices conserve current.
We also establish the uniqueness required for the conclusion. The cycle law implies that edge voltage drops are differences of vertex potentials: define a potential by summing drops along a path to , and cycle sums make this independent of the path. If two unit flows obey both laws, their difference has the form with zero divergence at every vertex. Therefore
Strict positivity of the conductances and connectedness force to be constant, so . We conclude the electrical current from stopped random-walk traversals identity