Prerequisites: Theorem A (energy isolation), Sinclair–Jerrum bound (Fact B.6).
Theorem D. Let and . The escape time from under the lazy walk satisfies:
Proof. (Complete.)
Step 1 (Restricted chain). Define the restricted sub-stochastic matrix on :
Row sums: .
Step 2 (Conductance bound). The conductance of the restricted chain on (with absorbing boundary) is:
where restricted to .
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 :
In the worst case (taking to be itself with absorbing exterior), the effective conductance is bounded by . More precisely, for any with :
Taking the minimum over : .
Step 3 (Spectral gap). By the Sinclair–Jerrum bound (Fact B.6): . For the lazy chain: .
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):
The factor arises because, for a lazy chain with spectral gap , the relaxation time is , and the mean hitting time to an absorbing set from the stationary distribution is at least (Aldous–Fill inequality for reversible absorbing chains).
Explicit constant. The bound is tight up to constant factors. For a barbell graph (two complete graphs of size connected by a single edge of weight ), the conductance is and the escape time is .