Consider a random walk on with absorbing states . At each interior state it stays in place with probability , and moves one position in either direction with probability , where . Its mean absorption time from isProof. A sequence of at most consecutive leftward moves ensures absorption, with probability at least . Dividing time into blocks of length gives a geometric series bound on the survival probabilities, so the expected value is finite. Let . The law of total expectation and first-step analysis giveThus . A particular solution of this linear recurrence relation is ; its homogeneous solutions are . The two boundary conditions give , , proving both the formula and its uniqueness. Holding slows the usual symmetric random walk by the factor .
At an absorbing state, the remaining absorption time is zero, so . Multiplying the linear recurrence relation by three givesThe second finite difference of is two. A particular solution is therefore , while every solution of the corresponding homogeneous linear recurrence relation has the form . The boundary conditions give and , henceThis is the mean absorption time of a lazy symmetric random walk with holding probability .
First the expected value of the absorption time is finite. From any interior state, consecutive leftward moves lead to absorption within at most steps, with probability at least . By independence of the subsequent steps, the probability of surviving steps is at most . Summing this geometric series bounds the expected value of the absorption time by .
Now apply first-step analysis. Starting from in the interior, one step is always used. Conditional on that step, the remaining expected values are , , and , each with probability . The law of total expectation therefore givesThe term remains even when the particle stays at , because a step has elapsed. Rearranging gives