Manuscript Oai212-A@1 · Oai212-A.tex · lemma · 79323841

Lemma: Escape bound and non-explosion

Classical first-passage process and finite-volume control › A constructive finite-volume tail bound · lines 228–260 · proof included or linked

Oai212-A@1#lem:escape

Back to manuscript

Fix and put

For and ,

Consequently is finite almost surely for every finite .

Proof. Any path reaching has, after loop erasure, at least edges. There are at most self-avoiding paths of length starting at . For each such path, independence and Markov's inequality give

Sum over . The resulting bound tends to zero as . An infinite would produce paths reaching arbitrarily large boundaries with cost at most . This event has probability zero. Take a countable intersection over integer .

Displayed formulas in this passage

  • unlabeled · line 231

  • unlabeled · line 235

  • unlabeled · line 251

Nearby in this section