Skorokhod's embedding theorem: Difference between revisions

Content deleted Content added
Skorokhod's first embedding theorem: Repairing links to disambiguation pages - You can help! using AWB
 
(9 intermediate revisions by 7 users not shown)
Line 1:
In [[mathematics]] and [[probability theory]], '''Skorokhod's embedding theorem''' is either or both of two [[theorem]]s that allow one to regard any suitable collection of [[random variable]]s as a [[Wiener process]] ([[Brownian motion]]) evaluated at a collection of [[stopping time]]s. Both results are named for the [[Ukraine|Ukrainian]] [[mathematician]] [[Anatoliy Skorokhod|A. V. Skorokhod]].
 
==Skorokhod's first embedding theorem==
Line 5:
Let ''X'' be a [[real number|real]]-valued random variable with [[expected value]] 0 and [[Wikt:finite|finite]] [[variance]]; let ''W'' denote a canonical real-valued Wiener process. Then there is a stopping time (with respect to the natural [[filtration (abstract algebra)|filtration]] of ''W''), ''&tau;'', such that ''W''<sub>''&tau;''</sub> has the same distribution as ''X'',
 
:<math>\mathbboperatorname{E}[\tau] = \mathbboperatorname{E}[X^{2}]</math>
 
and
 
:<math>\mathbboperatorname{E}[\tau^{2}] \leq 4 \mathbboperatorname{E}[X^{4}].</math>
 
==Skorokhod's second embedding theorem==
Line 15:
Let ''X''<sub>1</sub>, ''X''<sub>2</sub>, ... be a sequence of [[independent and identically distributed random variables]], each with expected value 0 and finite variance, and let
 
:<math>S_{n}S_n = X_{1}X_1 + \cdots + X_{n}X_n.</math>
 
Then there is a non-[[decreasing]]sequence (a.k.a.of weaklystopping increasing) sequencetimes ''&tau;''<sub>1</sub>, &le; ''&tau;''<sub>2</sub>, &le; ... of stopping times such that the <math>W_{\tau_{n}}</math> have the same joint distributions as the partial sums ''S''<sub>''n''</sub> and ''&tau;''<sub>1</sub>, ''&tau;''<sub>2</sub> &minus; ''&tau;''<sub>1</sub>, ''&tau;''<sub>3</sub> &minus; ''&tau;''<sub>2</sub>, ... are independent and identically distributed random variables satisfying
 
:<math>\mathbboperatorname{E}[\tau_{n}tau_n - \tau_{n - 1}] = \mathbboperatorname{E}[X_{1}X_1^{2}]</math>
 
and
 
:<math>\mathbboperatorname{E}[(\tau_{n} - \tau_{n - 1})^{2}] \leqle 4 \mathbboperatorname{E}[X_{1}X_1^{4}].</math>
 
==References==
Line 29:
* {{cite book | last=Billingsley | first=Patrick | title=Probability and Measure | publisher=John Wiley & Sons, Inc. | ___location=New York | year=1995 | isbn=0-471-00710-2}} (Theorems 37.6, 37.7)
 
[[Category:ProbabilityTheorems theoremsin probability theory]]
[[Category:StochasticWiener processesprocess]]
[[Category:Ukrainian inventions]]
[[uk:Теорема Скорохода про вкладення]]