∑Notes
Main Theorems A–H
11 equations extracted from this document. Each equation pairs with the prose paragraph that immediately precedes it in the source — clicking the title above opens the full document.
- #1
Step 1 (Restricted chain). Define the restricted sub-stochastic matrix on :
- #2
Step 2 (Conductance bound). The conductance of the restricted chain on (with absorbing boundary) is:
- #3
The numerator's first term is the internal flow out of within ; the second term is the leakage from to the exterior. Consider the cut of within the full graph. For any :
- #4
In the worst case (taking to be itself with absorbing exterior), the effective conductance is bounded by . More precisely, for any with :
- #5
Step 4 (Escape time). The expected absorption time from the quasi-stationary distribution satisfies (see Aldous--Fill, Theorem 12.4; or Montenegro--Tetali, Theorem 3.3):
- #6
(ii) Case . The optimal gauge satisfies the linear system (Theorem 7.11). The residual angles are . These solve:
- #7
The operator is the projection onto the cycle space of the graph. The residual curvature at node is:
- #8
The source of non-zero is the curvature (holonomy around cycles). Near doors, the cycles passing through the exterior create non-trivial holonomy. The Green's function of the graph Laplacian on has the well-known decay property: for a graph with spectral gap ,
- #9
At the optimal gauge , the Euler--Lagrange equation on each node reads:
- #10
The energy on is then controlled by a discrete maximum principle: interior values of cannot exceed boundary values (door-adjacent). Summing:
- #11
Denominator perturbation: .