|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| 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.
| | Nice to satisfy you, I am Marvella Shryock. South Dakota is her birth location but she needs to transfer because of her family. To gather badges is what her family members and her appreciate. In her professional life she is a payroll clerk but she's always needed her own business.<br><br>Here is my web page :: [http://203.250.78.160/zbxe/?document_srl=810524&mid=gallery&sort_index=regdate&order_type=desc at home std testing] |
| | |
| ==Definitions==
| |
| | |
| Let ''T'' be an ordered [[index set]] such as the [[natural number]]s, '''N''', the non-negative [[real number]]s, [0, +∞), or a subset of these; elements ''t'' ∈ ''T'' can be thought of as "times". Given a [[probability space]] (Ω, Σ, Pr) and a [[measurable space|measurable state space]] ''S'', let ''X'' : Ω × ''T'' → ''S'' be a [[stochastic process]], and let ''A'' be a [[measurable set|measurable subset]] of the state space ''S''. Then the '''first hit time''' ''τ''<sub>''A''</sub> : Ω → [0, +∞] is the [[random variable]] defined by
| |
| | |
| :<math>\tau_{A} (\omega) := \inf \{ t \in T | X_{t} (\omega) \in A \}.</math>
| |
| | |
| The '''first exit time''' (from ''A'') is defined to be the first hit time for ''S'' \ ''A'', the [[complement (set theory)|complement]] of ''A'' in ''S''. Confusingly, this is also often denoted by ''τ''<sub>''A''</sub> (e.g. in Øksendal (2003)).
| |
| | |
| The '''first return time''' is defined to be the first hit time for the [[singleton (mathematics)|singleton]] set { ''X''<sub>0</sub>(''ω'') }, 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 [[Hitting time#Début theorem|Début theorem]] (Fischer, 2013).
| |
| | |
| * Let ''B'' denote standard [[Wiener process|Brownian motion]] on the [[real line]] '''R''' starting at the origin. Then the hitting time ''τ''<sub>''A''</sub> satisfies the measurability requirements to be a stopping time for every Borel measurable set ''A'' ⊆ '''R'''.
| |
| | |
| * For ''B'' as above, let <math>\tau_r</math> (<math>r>0</math>) denote the first exit time for the interval (−''r'', ''r''), i.e. the first hit time for (−∞, −''r''] ∪ [''r'', +∞). Then the [[expected value]] and [[variance]] of <math>\tau_r</math> satisfy
| |
| :<math>\mathbb{E} \left[ \tau_{r} \right] = r^{2},</math>
| |
| :<math>\mathrm{Var} \left[ \tau_{r} \right] = (2/3) r^{4}.</math>
| |
| | |
| * 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 process]]es.
| |
| The proof that the début is measurable is rather involved and involves properties of [[analytic set]]s. The theorem requires the underlying probability space to be [[complete measure|complete]] or, at least, universally complete.
| |
| | |
| The ''converse of the Début theorem'' states that every [[stopping time]] defined with respect to a [[Filtration (mathematics)|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 <math> \{ 0 \}</math> by this process is the considered stopping time. The proof is very simple (Fischer, 2013).
| |
| | |
| ==See also==
| |
| *[[Stopping time]]
| |
| ==References==
| |
| | |
| * {{cite journal|last=Fischer|first=Tom|title=On simple representations of stopping times and stopping time sigma-algebras|journal=Statistics and Probability Letters|year=2013|volume=83|issue=1|pages=345–349|doi=10.1016/j.spl.2012.09.024|url=http://dx.doi.org/10.1016/j.spl.2012.09.024}}
| |
| | |
| * {{cite book
| |
| | last = Øksendal
| |
| | first = Bernt K.
| |
| | authorlink = Bernt Øksendal
| |
| | title = Stochastic Differential Equations: An Introduction with Applications
| |
| | edition = Sixth edition
| |
| | publisher=Springer
| |
| | location = Berlin
| |
| | year = 2003
| |
| | isbn = 3-540-04758-1
| |
| }}
| |
| | |
| [[Category:Stochastic processes]]
| |
Nice to satisfy you, I am Marvella Shryock. South Dakota is her birth location but she needs to transfer because of her family. To gather badges is what her family members and her appreciate. In her professional life she is a payroll clerk but she's always needed her own business.
Here is my web page :: at home std testing