Hitting time

From testwiki
Jump to navigation Jump to search

Template:Short description

The hitting and stopping times of three samples of Brownian motion.
The Hitting times and stopping times of three samples of Brownian motion.

In the study of stochastic processes in mathematics, a hitting time (or first hit time) is the first time at which a given process "hits" a given subset of the state space. Exit times and return times are also examples of hitting times.

Definitions

Let Template:Mvar be an ordered index set such as the natural numbers, Template:Tmath the non-negative real numbers, Template:Math, or a subset of these; elements Template:Tmath can be thought of as "times". Given a probability space Template:Math and a measurable state space Template:Mvar, let X:Ω×TS be a stochastic process, and let Template:Mvar be a measurable subset of the state space Template:Mvar. Then the first hit time τA:Ω[0,+] is the random variable defined by

τA(ω):=inf{tTXt(ω)A}.

The first exit time (from Template:Mvar) is defined to be the first hit time for Template:Math, the complement of Template:Mvar in Template:Mvar. Confusingly, this is also often denoted by Template:Mvar.[1]

The first return time is defined to be the first hit time for the singleton set Template:Math which is usually a given deterministic element of the state space, such as the origin of the coordinate system.

Examples

E[τr]=r2,Var[τr]=23r4.

Début theorem

The hitting time of a set Template:Mvar is also known as the début of Template:Mvar. The Début theorem says that the hitting time of a measurable set Template:Mvar, for a progressively measurable process with respect to a right continuous and complete filtration, is a stopping time. Progressively measurable processes include, in particular, all right and left-continuous adapted processes. The proof that the début is measurable is rather involved and involves properties of analytic sets. The theorem requires the underlying probability space to be complete or, at least, universally complete.

The converse of the Début theorem states that every stopping time defined with respect to a filtration over a real-valued time index can be represented by a hitting time. In particular, for essentially any such stopping time there exists an adapted, non-increasing process with càdlàg (RCLL) paths that takes the values 0 and 1 only, such that the hitting time of the set Template:Math by this process is the considered stopping time. The proof is very simple.[2]

See also

References

Template:Reflist