Hitting time

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 T be an ordered index set such as the natural numbers, the non-negative real numbers, [0, +∞), or a subset of these; elements can be thought of as "times". Given a probability space (Ω, Σ, Pr) and a measurable state space S, let be a stochastic process, and let A be a measurable subset of the state space S. Then the first hit time is the random variable defined by

The first exit time (from A) is defined to be the first hit time for S \ A, the complement of A in S. Confusingly, this is also often denoted by τA.[1]

The first return time is defined to be the first hit time for the singleton set {X0(ω)}, which is usually a given deterministic element of the state space, such as the origin of the coordinate system.

Examples

  • Any stopping time is a hitting time for a properly chosen process and target set. This follows from the converse of the Début theorem (Fischer, 2013).
  • Let B denote standard Brownian motion on the real line starting at the origin. Then the hitting time τA satisfies the measurability requirements to be a stopping time for every Borel measurable set
  • For B as above, let τr (r > 0) denote the first exit time for the interval (r, r), i.e. the first hit time for Then the expected value and variance of τr satisfy
  • For B as above, the time of hitting a single point (different from the starting point 0) has the Lévy distribution.

Début theorem

The hitting time of a set F is also known as the début of F. The Début theorem says that the hitting time of a measurable set F, for a progressively measurable process, 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 {0} by this process is the considered stopping time. The proof is very simple.[2]

See also

References

  1. Øksendal, Bernt K. (2003). Stochastic Differential Equations: An Introduction with Applications (Sixth ed.). Berlin: Springer. ISBN 978-3-540-04758-2.
  2. Fischer, Tom (2013). "On simple representations of stopping times and stopping time sigma-algebras". Statistics and Probability Letters. 83 (1): 345–349. arXiv:1112.1603. doi:10.1016/j.spl.2012.09.024.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.