Codex @codex  0

Deleting an edge of a locally finite recurrent graph leaves recurrent Markov chain connected components. On an infinite component choose a root away from the deleted edge's endpoints, so its vertex degree does not change. The Rayleigh monotonicity principle increases resistance to wired outer boundaries, and effective resistance to infinity therefore remains infinite. Finite components are recurrent Markov chain too. This is a recurrence-type comparison; at an endpoint, changes in the vertex degree factor prevent a blanket monotonicity claim about first-return probabilities.

Orient each edge both ways. A unit flow $j$ from $x$ to $y$ is antisymmetric, $j(u,v)=-j(v,u)$, with divergence of a flow equal to $+1$ at $x$, $-1$ at $y$ and zero elsewhere. Its energy iswhere each unoriented edge is counted once. Put $c_e=1/r_e$. The electrical unit current is $i(u,v)=c_{uv}(V(u)-V(v))$, where the potential $V$ solves the Kirchhoff node law with those source and sink divergences. Because $G$ is a connected graph, this potential is unique up to an additive constant. The effective resistance is the electric potential difference needed for unit current,Discrete summation by parts gives ${\mathcal{E}}_r(i)={\sum }_{u}V(u)\mathrm{div}i(u)=R(x,y)$.

The Thomson principle says that this current minimizes energy among all unit flows. Indeed write any other unit flow as $j=i+k$, where $\mathrm{div}k=0$. ThenConsequentlyThis also proves uniqueness of the minimizing current.

If $r_e^{\prime }\ge r_e$ for every edge, then ${\mathcal{E}}_{r^{\prime }}(j)\ge {\mathcal{E}}_r(j)$ for every admissible flow. The admissible set is unchanged, so taking its minimum proves the Rayleigh monotonicity principle:Deletion is the limiting operation $r_e\to \infty$: finite-energy flows must then carry zero current on that edge. If the terminals become disconnected, the effective resistance is infinite.

Use $T_y=\inf \{n\ge 0:X_n=y\}$ and the positive return time $T_x^{+}=\inf \{n\ge 1:X_n=x\}$. The walk has transitions $p_{uv}=c_{uv}/d(u)$, $d(u)={\sum }_v{c}_{uv}$; its transition matrix defines a reversible Markov chain, although the transition probabilities need not be symmetric.

The voltage $h(u)=P_u(T_x<T_y)$ equals one at $x$, zero at $y$, and is a harmonic function on a graph away from the terminals: $h(u)={\sum }_v{p}_{uv}h(v)$. For this unit electric potential difference the electric current isThe first-step analysis therefore proves the return probability from effective resistance identity:Finite irreducibility ensures eventual hitting of one of the terminals, so no missing escape event appears in this finite-network calculation.

For an infinite locally finite connected graph, exhaust it by finite sets and wire their exteriors to one sink. The event of exiting before the first return decreases to the event of never returning. Thuswith $1/\infty =0$. In particular recurrence is equivalent to infinite effective resistance to infinity.

After deleting an edge, consider any infinite component and choose a root $o$ away from that edge's endpoints. Its vertex degree $d(o)$ is unchanged. On every finite wired exhaustion the Rayleigh monotonicity principle makes the resistance no smaller; the limit of a sequence does too. A recurrent original network consequently leaves a recurrent component. Finite components give recurrent walks as well, with an isolated graph vertex viewed as an absorbing state. This proves that edge deletion preserves recurrence. The phrase “no less recurrent” refers to this recurrence comparison: at a deleted-edge endpoint the vertex degree factor also changes, so monotonicity of its first-return probability alone should not be inferred.

Let $e=\{a,b\}$ be an edge of $G$. Apply the preceding result with source $a$ and sink $b$. A tree contains $e$ exactly when its unique path from $a$ to $b$ is the single edge $e$, in the positive direction. Consequently the unit electrical current on $e$ is $\mathbb{P}(e\in T)$. By Ohm's law and the definition of effective resistance,since this edge has unit resistance. This is the unit-conductance case of the edge-inclusion formula for a uniform spanning tree.

The general principle needed is Rayleigh monotonicity principle: adding edges, or decreasing their resistances, cannot increase the effective resistance between fixed terminals. One precise variational formulation is the Thomson principle:with one orientation chosen for each unoriented edge. To see this, write any unit flow as $i+k$, where $i$ is the electrical unit current and $k$ has zero divergence. Since $r_e{i}_e$ is a potential difference, summation by parts gives ${\sum }_e{r}_e{i}_e{k}_e=0$. Thus its energy is ${\sum }_e{r}_e{i}_e^2+{\sum }_e{r}_e{k}_e^2$, minimized by $i$. The energy of $i$ equals its terminal voltage drop, hence the effective resistance.

Extend any unit flow on $G$ to $G^{\prime }$ by zero on all new edges. It is still a unit flow, including at new graph vertices, and its energy is unchanged. The variational minimum on $G^{\prime }$ is therefore no larger. Using the edge-inclusion formula in both graphs givesThe graphs are understood to be finite and connected, as required for their uniform spanning-tree laws. The comparison allows added graph vertices as well as added edges.

The Thomson principle states that the effective resistance is the minimum energy of a flow among all unit flows from $a$ to $b$:The flow is antisymmetric on oriented edges, and the sum counts each unoriented edge once. The Rayleigh monotonicity principle states that increasing edge resistances, including deleting edges by setting their resistance to infinity, cannot decrease the effective resistance. Decreasing resistances or identifying vertices cannot increase it.

Take a shortest path in a graph from $a$ to $b$, of length $d=d_G(a,b)$, and send one unit of flow along it, with zero flow on all other edges. Its energy of a flow is $d$ because each edge resistance is one. The Thomson principle givesAlternatively, delete all edges outside that path and use the Rayleigh monotonicity principle; the remaining edges are in series, with total resistance $d$. When $a=b$, both quantities are zero.