Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Martingale (probability theory)

From Wikipedia, the free encyclopedia
(Redirected fromSubmartingale)
Model in probability theory
For the martingale betting strategy, seemartingale (betting system).

Inprobability theory, amartingale is asequence ofrandom variables (i.e., astochastic process) for which, at a particular time, theconditional expectation of the next value in the sequence is equal to the present value, regardless of all prior values.

Stopped Brownian motion is an example of a martingale. It can model an even coin-toss betting game with the possibility of bankruptcy.

History

[edit]

Originally,martingale referred to a class ofbetting strategies that was popular in 18th-centuryFrance.[1][2] The simplest of these strategies was designed for a game in which thegambler wins their stake if a coin comes up heads and loses it if the coin comes up tails. The strategy had the gambler double their bet after every loss so that the first win would recover all previous losses plus win a profit equal to the original stake. As the gambler's wealth and available time jointly approach infinity, their probability of eventually flipping heads approaches 1, which makes the martingale betting strategy seem like asure thing. However, theexponential growth of the bets eventually bankrupts its users due to finite bankrolls.Stopped Brownian motion, which is a martingale process, can be used to model the trajectory of such games.

The concept of martingale in probability theory was introduced byPaul Lévy in 1934, though he did not name it. The term "martingale" was introduced later byVille (1939), who also extended the definition to continuous martingales. Much of the original development of the theory was done byJoseph Leo Doob among others. Part of the motivation for that work was to show the impossibility of successful betting strategies in games of chance.

Definitions

[edit]

A basic definition of adiscrete-timemartingale is a discrete-timestochastic process (i.e., asequence ofrandom variables)X1X2X3, ... that satisfies for any timen,

E(|Xn|)<{\displaystyle \mathbf {E} (\vert X_{n}\vert )<\infty }
E(Xn+1X1,,Xn)=Xn.{\displaystyle \mathbf {E} (X_{n+1}\mid X_{1},\ldots ,X_{n})=X_{n}.}

That is, theconditional expected value of the next observation, given all the past observations, is equal to the most recent observation.

Martingale sequences with respect to another sequence

[edit]

More generally, a sequenceY1Y2Y3 ... is said to be amartingale with respect to another sequenceX1X2X3 ... if for alln

E(|Yn|)<{\displaystyle \mathbf {E} (\vert Y_{n}\vert )<\infty }
E(Yn+1X1,,Xn)=Yn.{\displaystyle \mathbf {E} (Y_{n+1}\mid X_{1},\ldots ,X_{n})=Y_{n}.}

Similarly, acontinuous-time martingale with respect to thestochastic processXt is astochastic processYt such that for allt

E(|Yt|)<{\displaystyle \mathbf {E} (\vert Y_{t}\vert )<\infty }
E(Yt{Xτ,τs})=Ysst.{\displaystyle \mathbf {E} (Y_{t}\mid \{X_{\tau },\tau \leq s\})=Y_{s}\quad \forall s\leq t.}

This expresses the property that the conditional expectation of an observation at timet, given all the observations up to times{\displaystyle s}, is equal to the observation at times (of course, provided thats ≤ t). The second property implies thatYn{\displaystyle Y_{n}} is measurable with respect toX1Xn{\displaystyle X_{1}\dots X_{n}}.

General definition

[edit]

In full generality, astochastic processY:T×ΩS{\displaystyle Y:T\times \Omega \to S} taking values in aBanach spaceS{\displaystyle S} with normS{\displaystyle \lVert \cdot \rVert _{S}} is amartingale with respect to a filtrationΣ{\displaystyle \Sigma _{*}}andprobability measureP{\displaystyle \mathbb {P} } if

EP(YtS)<+;{\displaystyle \mathbf {E} _{\mathbb {P} }(\lVert Y_{t}\rVert _{S})<+\infty ;}
  • for alls andt withs < t and allF ∈ Σs,
EP([YtYs]χF)=0,{\displaystyle \mathbf {E} _{\mathbb {P} }\left([Y_{t}-Y_{s}]\chi _{F}\right)=0,}
whereχF denotes theindicator function of the eventF. In Grimmett and Stirzaker'sProbability and Random Processes, this last condition is denoted as
Ys=EP(YtΣs),{\displaystyle Y_{s}=\mathbf {E} _{\mathbb {P} }(Y_{t}\mid \Sigma _{s}),}
which is a general form ofconditional expectation.[3]

It is important to note that the property of being a martingale involves both the filtrationand the probability measure (with respect to which the expectations are taken). It is possible thatY could be a martingale with respect to one measure but not another one; theGirsanov theorem offers a way to find a measure with respect to which anItō process is a martingale.

In the Banach space setting the conditional expectation is also denoted in operator notation asEΣsYt{\displaystyle \mathbf {E} ^{\Sigma _{s}}Y_{t}}.[4]

Examples of martingales

[edit]
  • An unbiasedrandom walk, in any number of dimensions, is an example of a martingale. For example, consider a 1-dimensional random walk where at each time step a move to the right or left is equally likely.
  • A gambler's fortune (capital) is a martingale if all the betting games which the gambler plays are fair. The gambler is playing a game ofcoin flipping. SupposeXn is the gambler's fortune aftern tosses of afair coin, such that the gambler wins $1 if the coin toss outcome is heads and loses $1 if the coin toss outcome is tails. The gambler's conditional expected fortune after the next game, given the history, is equal to his present fortune. This sequence is thus a martingale.
  • LetYn =Xn2n whereXn is the gambler's fortune from the prior example. Then the sequence {Yn :n = 1, 2, 3, ... } is a martingale. This can be used to show that the gambler's total gain or loss varies roughly between plus or minus thesquare root of the number of games of coin flipping played.
  • de Moivre's martingale: Suppose thecoin toss outcomes are unfair, i.e., biased, with probabilityp of coming up heads and probabilityq = 1 − p of tails. Let
Xn+1=Xn±1{\displaystyle X_{n+1}=X_{n}\pm 1}
with "+" in case of "heads" and "−" in case of "tails". Let
Yn=(q/p)Xn{\displaystyle Y_{n}=(q/p)^{X_{n}}}
Then {Yn :n = 1, 2, 3, ... } is a martingale with respect to {Xn :n = 1, 2, 3, ... }. To show this
E[Yn+1X1,,Xn]=p(q/p)Xn+1+q(q/p)Xn1=p(q/p)(q/p)Xn+q(p/q)(q/p)Xn=q(q/p)Xn+p(q/p)Xn=(q/p)Xn=Yn.{\displaystyle {\begin{aligned}E[Y_{n+1}\mid X_{1},\dots ,X_{n}]&=p(q/p)^{X_{n}+1}+q(q/p)^{X_{n}-1}\\[6pt]&=p(q/p)(q/p)^{X_{n}}+q(p/q)(q/p)^{X_{n}}\\[6pt]&=q(q/p)^{X_{n}}+p(q/p)^{X_{n}}=(q/p)^{X_{n}}=Y_{n}.\end{aligned}}}
  • Pólya's urn contains a number of different-coloured marbles; at eachiteration a marble is randomly selected from the urn and replaced with several more of that same colour. For any given colour, the fraction of marbles in the urn with that colour is a martingale. For example, if currently 95% of the marbles are red then, though the next iteration is more likely to add red marbles than another color, this bias is exactly balanced out by the fact that adding more red marbles alters the fraction much less significantly than adding the same number of non-red marbles would.
  • Likelihood-ratio testing instatistics: A random variableX is thought to be distributed according either to probability densityf or to a different probability densityg. Arandom sampleX1, ...,Xn is taken. LetYn be the "likelihood ratio"
Yn=i=1ng(Xi)f(Xi){\displaystyle Y_{n}=\prod _{i=1}^{n}{\frac {g(X_{i})}{f(X_{i})}}}
If X is actually distributed according to the densityf rather than according tog, then {Yn :n=1, 2, 3,...} is a martingale with respect to {Xn :n=1, 2, 3, ...}
Software-created martingale series

Submartingales, supermartingales, and relationship to harmonic functions

[edit]

There are two generalizations of a martingale that also include cases when the current observationXn is not necessarily equal to the future conditional expectationE[Xn+1 | X1,...,Xn] but instead an upper or lower bound on the conditional expectation. These generalizations reflect the relationship between martingale theory andpotential theory, that is, the study ofharmonic functions. Just as a continuous-time martingale satisfies E[Xt | {Xτ : τ ≤ s}] − Xs = 0 ∀s ≤ t, a harmonic functionf satisfies thepartial differential equation Δf = 0 where Δ is theLaplacian operator. Given aBrownian motion processWt and a harmonic functionf, the resulting processf(Wt) is also a martingale.

E[Xn+1X1,,Xn]Xn.{\displaystyle \operatorname {E} [X_{n+1}\mid X_{1},\ldots ,X_{n}]\geq X_{n}.}
Likewise, a continuous-time submartingale satisfies
E[Xt{Xτ:τs}]Xsst.{\displaystyle \operatorname {E} [X_{t}\mid \{X_{\tau }:\tau \leq s\}]\geq X_{s}\quad \forall s\leq t.}
In potential theory, asubharmonic functionf satisfies Δf ≥ 0. Any subharmonic function that is bounded above by a harmonic function for all points on the boundary of a ball is bounded above by the harmonic function for all points inside the ball. Similarly, if a submartingale and a martingale have equivalent expectations for a given time, the history of the submartingale tends to be bounded above by the history of the martingale. Roughly speaking, theprefix "sub-" is consistent because the current observationXn isless than (or equal to) the conditional expectationE[Xn+1 | X1,...,Xn]. Consequently, the current observation provides supportfrom below the future conditional expectation, and the process tends to increase in future time.
  • Analogously, a discrete-timesupermartingale satisfies
E[Xn+1X1,,Xn]Xn.{\displaystyle \operatorname {E} [X_{n+1}\mid X_{1},\ldots ,X_{n}]\leq X_{n}.}
Likewise, a continuous-time supermartingale satisfies
E[Xt{Xτ:τs}]Xsst.{\displaystyle \operatorname {E} [X_{t}\mid \{X_{\tau }:\tau \leq s\}]\leq X_{s}\quad \forall s\leq t.}
In potential theory, asuperharmonic functionf satisfies Δf ≤ 0. Any superharmonic function that is bounded below by a harmonic function for all points on the boundary of a ball is bounded below by the harmonic function for all points inside the ball. Similarly, if a supermartingale and a martingale have equivalent expectations for a given time, the history of the supermartingale tends to be bounded below by the history of the martingale. Roughly speaking, the prefix "super-" is consistent because the current observationXn isgreater than (or equal to) the conditional expectationE[Xn+1 | X1,...,Xn]. Consequently, the current observation provides supportfrom above the future conditional expectation, and the process tends to decrease in future time.

Examples of submartingales and supermartingales

[edit]
  • Every martingale is also a submartingale and a supermartingale. Conversely, any stochastic process that isboth a submartingale and a supermartingale is a martingale.
  • Consider again the gambler who wins $1 when a coin comes up heads and loses $1 when the coin comes up tails. Suppose now that the coin may be biased, so that it comes up heads with probabilityp.
    • Ifp is equal to 1/2, the gambler on average neither wins nor loses money, and the gambler's fortune over time is a martingale.
    • Ifp is less than 1/2, the gambler loses money on average, and the gambler's fortune over time is a supermartingale.
    • Ifp is greater than 1/2, the gambler wins money on average, and the gambler's fortune over time is a submartingale.
  • Aconvex function of a martingale is a submartingale, byJensen's inequality. For example, the square of the gambler's fortune in the fair coin game is a submartingale (which also follows from the fact thatXn2 − n is a martingale). Similarly, aconcave function of a martingale is a supermartingale.

Martingales and stopping times

[edit]
Main article:Stopping time

Astopping time with respect to a sequence of random variablesX1X2X3, ... is a random variable τ with the property that for eacht, the occurrence or non-occurrence of the eventτ =t depends only on the values ofX1X2X3, ..., Xt. The intuition behind the definition is that at any particular timet, you can look at the sequence so far and tell if it is time to stop. An example in real life might be the time at which a gambler leaves the gambling table, which might be a function of their previous winnings (for example, he might leave only when he goes broke), but he can't choose to go or stay based on the outcome of games that haven't been played yet.

In some contexts the concept ofstopping time is defined by requiring only that the occurrence or non-occurrence of the eventτ = t isprobabilistically independent ofXt + 1Xt + 2, ... but not that it is completely determined by the history of the process up to time t. That is a weaker condition than the one appearing in the paragraph above, but is strong enough to serve in some of the proofs in which stopping times are used.

One of the basic properties of martingales is that, if(Xt)t>0{\displaystyle (X_{t})_{t>0}} is a (sub-/super-) martingale andτ{\displaystyle \tau } is a stopping time, then the corresponding stopped process(Xtτ)t>0{\displaystyle (X_{t}^{\tau })_{t>0}} defined byXtτ:=Xmin{τ,t}{\displaystyle X_{t}^{\tau }:=X_{\min\{\tau ,t\}}} is also a (sub-/super-) martingale.

The concept of a stopped martingale leads to a series of important theorems, including, for example, theoptional stopping theorem which states that, under certain conditions, the expected value of a martingale at a stopping time is equal to its initial value.

See also

[edit]

Notes

[edit]
  1. ^Balsara, N. J. (1992).Money Management Strategies for Futures Traders. Wiley Finance. p. 122.ISBN 978-0-471-52215-7.martingale.
  2. ^Mansuy, Roger (June 2009)."The origins of the Word "Martingale""(PDF).Electronic Journal for History of Probability and Statistics.5 (1).Archived(PDF) from the original on 2012-01-31. Retrieved2011-10-22.
  3. ^Grimmett, G.; Stirzaker, D. (2001).Probability and Random Processes (3rd ed.). Oxford University Press.ISBN 978-0-19-857223-7.
  4. ^Bogachev, Vladimir (1998).Gaussian Measures. American Mathematical Society. pp. 372–373.ISBN 978-1470418694.

References

[edit]
Discrete time
Continuous time
Both
Fields and other
Time series models
Financial models
Actuarial models
Queueing models
Properties
Limit theorems
Inequalities
Tools
Disciplines
Authority control databases: NationalEdit this at Wikidata
Retrieved from "https://en.wikipedia.org/w/index.php?title=Martingale_(probability_theory)&oldid=1265174599"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp