Work on a filtered probability space . A submartingale is a real-valued stochastic process satisfying the following three conditions: is -measurable, , and
Thus it is adapted, has integrable random variables at every time, and its conditional expected next value is at least its current value. Repeated conditioning gives for every . The inequality concerns conditional expectation; individual sample paths need not increase. If no filtration is specified, the definition can be applied to the natural filtration generated by the process.
The almost sure submartingale convergence theorem says that if a submartingale satisfies
then there is an integrable random variable such that
Indeed the positive-part bound also bounds the negative parts, since ; the theorem gives a finite limit. In particular, the martingale convergence theorem applies to any martingale with .
For a nonnegative martingale, supplies this bound automatically. Its limit obeys by the Fatou lemma. Almost sure convergence alone need not preserve the expectation or give convergence in L1. Uniform integrability is the additional condition that supplies convergence in L1 and the identity .
Take independent and identically distributed random variables with the Bernoulli distribution of parameter , and their natural filtration. Set
The event at is the whole sample space. Independence gives
so this is a nonnegative martingale; it is integrable with . The first zero among the is almost surely finite, since the probability of having only ones through time is . After that first zero, every is zero. Hence the almost sure limit is zero:
This fair-coin doubling martingale also exhibits failure of uniform integrability: convergence in L1 would force the expectations to converge to zero.
Let be the natural filtration of the random walk on a graph. For a bounded harmonic function on a graph, the transition rule and the Markov property give
Thus is a bounded martingale. The martingale convergence theorem gives a finite almost sure limit .
On the probability-one recurrence event, every vertex is visited along a sequence . Along that sequence , while convergence of the whole sequence forces . Therefore every pair of vertices has the same value. This is the bounded harmonic function theorem on a recurrent graph:
Recurrence makes each vertex value a subsequential limit of the same convergent martingale. A connected locally finite graph is countable, since it is the union of its finite distance balls, so these almost sure assertions can also be combined by a countable intersection. The one-vertex case is immediate.
Write for the martingale difference sequence. Bounded increments mean that one deterministic satisfies for every , almost surely. Then and, for ,
The increments are uncorrelated random variables, uniformly bounded in . Applying the supplied strong law for uniformly L2-bounded uncorrelated random variables gives almost surely. Also , because is finite almost surely. Therefore a martingale with bounded increments has zero linear growth:
This is the strong law for martingales with bounded increments.
For the submartingale, let and define its predictable drift and compensator by
This is the Doob decomposition in discrete time. The process is a martingale. Since , we have , so . The result just proved gives almost surely, and . Consequently the strong law for submartingales with bounded increments is
The compensator may grow, so the conclusion is a lower bound rather than a claim of convergence to zero.

Articles by others on the same topic (0)

There are currently no matching articles.