Bradford Factor: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Tmol42
rvt incorrect information and formatting added
en>McGeddon
section headers
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.
Hi there, I am Alyson Pomerleau and I think it seems fairly good when you say it. She works as a journey agent but quickly she'll be on her personal. To play lacross is the factor I love most of all. For many years she's been living in Kentucky but her spouse wants them to move.<br><br>My web site: authentic psychic readings ([http://www.onbizin.co.kr/xe/?document_srl=320614 great site])
 
==Definitions==
 
Let ''T'' be an ordered [[index set]] such as the [[natural number]]s, '''N''', the non-negative [[real number]]s, [0,&nbsp;+∞), or a subset of these; elements ''t''&nbsp;∈&nbsp;''T'' can be thought of as "times". Given a [[probability space]] (Ω,&nbsp;Σ,&nbsp;Pr) and a [[measurable space|measurable state space]] ''S'', let ''X''&nbsp;:&nbsp;Ω&nbsp;&times;&nbsp;''T''&nbsp;→&nbsp;''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>&nbsp;:&nbsp;Ω&nbsp;→&nbsp;[0,&nbsp;+∞] 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''&nbsp;\&nbsp;''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 {&nbsp;''X''<sub>0</sub>(''ω'')&nbsp;}, 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''&nbsp;⊆&nbsp;'''R'''.
 
* For ''B'' as above, let <math>\tau_r</math> (<math>r>0</math>) denote the first exit time for the interval (&minus;''r'',&nbsp;''r''), i.e. the first hit time for (&minus;∞,&nbsp;&minus;''r'']&nbsp;∪&nbsp;[''r'',&nbsp;+∞). 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&eacute;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]]

Revision as of 11:33, 13 February 2014

Hi there, I am Alyson Pomerleau and I think it seems fairly good when you say it. She works as a journey agent but quickly she'll be on her personal. To play lacross is the factor I love most of all. For many years she's been living in Kentucky but her spouse wants them to move.

My web site: authentic psychic readings (great site)