The events form a partition of a sample space when they are pairwise disjoint sets and cover the whole sample space:
Thus exactly one of these events occurs on every outcome. Under the usual set partition convention the parts are nonempty; empty parts can simply be discarded.
For an integrable random variable , the law of total expectation for the partition of a sample space is
Parts of zero probability contribute zero and need no definition of . To see the identity, write and use linearity of expectation; integrability justifies the countable sum since .
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 gives
The term remains even when the particle stays at , because a step has elapsed. Rearranging gives
At an absorbing state, the remaining absorption time is zero, so . Multiplying the linear recurrence relation by three gives
The 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 , hence
This is the mean absorption time of a lazy symmetric random walk with holding probability .
Each random variable has mean zero and second moment , so its variance is . For , linearity of expectation and variance additivity for independent random variables give
Each has the same probability distribution as , and independence makes and identically distributed. Thus their two strict tail probabilities are equal:
Apply Chebyshev's inequality using the mean and variance from part (i):
The equal-tail argument is essential: applying Chebyshev's inequality directly to the absolute tail alone gives the weaker bound .

Articles by others on the same topic (0)

There are currently no matching articles.