Martingale (probability theory)

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

In probability theory, a martingale is a sequence of random variables (i.e., a stochastic process) for which, at a particular time in the realized sequence, the expectation of the next value in the sequence is equal to the present observed value even given knowledge of all prior observed values.

To contrast, in a process that is not a martingale, it may still be the case that the expected value of the process at one time is equal to the expected value of the process at the next time. However, knowledge of the prior outcomes (e.g., all prior cards drawn from a card deck) may be able to reduce the uncertainty of future outcomes. Thus, the expected value of the next outcome given knowledge of the present and all prior outcomes may be higher than the current outcome if a winning strategy is used. Martingales exclude the possibility of winning strategies based on game history, and thus they are a model of fair games.

History

Originally, martingale referred to a class of betting strategies that was popular in 18th-century France.^[1]^[2] The simplest of these strategies was designed for a game in which the gambler wins his stake if a coin comes up heads and loses it if the coin comes up tails. The strategy had the gambler double his 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, his probability of eventually flipping heads approaches 1, which makes the martingale betting strategy seem like a sure thing. However, the exponential growth of the bets eventually bankrupts its users, assuming the obvious and realistic finite bankrolls (one of the reasons casinos, though normatively enjoying a mathematical edge in the games offered to their patrons, impose betting limits). 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 by Paul Lévy in 1934, though he did not name them: the term "martingale" was introduced later by Ville (1939), who also extended the definition to continuous martingales. Much of the original development of the theory was done by Joseph Leo Doob among others. Part of the motivation for that work was to show the impossibility of successful betting strategies.

Definitions

A basic definition of a discrete-time martingale is a discrete-time stochastic process (i.e., a sequence of random variables) X₁, X₂, X₃, ... that satisfies for any time n,

\mathbf {E} (\vert X_{n}\vert )<\infty

\mathbf {E} (X_{n+1}\mid X_{1},\ldots ,X_{n})=X_{n}.

That is, the conditional 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

More generally, a sequence Y₁, Y₂, Y₃ ... is said to be a martingale with respect to another sequence X₁, X₂, X₃ ... if for all n

\mathbf {E} (\vert Y_{n}\vert )<\infty

\mathbf {E} (Y_{n+1}\mid X_{1},\ldots ,X_{n})=Y_{n}.

Similarly, a continuous-time martingale with respect to the stochastic process X_t is a stochastic process Y_t such that for all t

\mathbf {E} (\vert Y_{t}\vert )<\infty

\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 time t, given all the observations up to time $s$ , is equal to the observation at time s (of course, provided that s ≤ t).

General definition

In full generality, a stochastic process $Y:T\times \Omega \to S$ is a martingale with respect to a filtration $\Sigma _{*}$ and probability measure P if

Σ_∗ is a filtration of the underlying probability space (Ω, Σ, P);
Y is adapted to the filtration Σ_∗, i.e., for each t in the index set T, the random variable Y_t is a Σ_t-measurable function;
for each t, Y_t lies in the L^p space L¹(Ω, Σ_t, P; S), i.e.

\mathbf {E} _{\mathbf {P} }(|Y_{t}|)<+\infty ;

for all s and t with s < t and all F ∈ Σ_s,

\mathbf {E} _{\mathbf {P} }\left([Y_{t}-Y_{s}]\chi _{F}\right)=0,

where χ_F denotes the indicator function of the event F. In Grimmett and Stirzaker's Probability and Random Processes, this last condition is denoted as

Y_{s}=\mathbf {E} _{\mathbf {P} }(Y_{t}|\Sigma _{s}),

which is a general form of conditional expectation.^[3]

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

Examples of martingales

An unbiased random walk (in any number of dimensions) is an example of a martingale.
A gambler's fortune (capital) is a martingale if all the betting games which the gambler plays are fair.
Polya's urn contains a number of different coloured marbles; at each iteration 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.
Suppose X_n is a gambler's fortune after n tosses of a fair coin, where the gambler wins $1 if the coin comes up heads and loses $1 if it's tails. The gambler's conditional expected fortune after the next trial, given the history, is equal to his present fortune. This sequence is thus a martingale.
Let Y_n = X_n² − n where X_n is the gambler's fortune from the preceding example. Then the sequence { Y_n : 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 the square root of the number of steps.
(de Moivre's martingale) Now suppose the coin is unfair, i.e., biased, with probability p of coming up heads and probability q = 1 − p of tails. Let

X_{n+1}=X_{n}\pm 1

with "+" in case of "heads" and "−" in case of "tails". Let

Y_{n}=(q/p)^{X_{n}}.

Then { Y_n : n = 1, 2, 3, ... } is a martingale with respect to { X_n : n = 1, 2, 3, ... }. To show this

{\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}}

(Likelihood-ratio testing in statistics) A random variable X is thought to be distributed according either to probability density f or to a different probability density g. A random sample X₁, ..., X_n is taken. Let Y_n be the "likelihood ratio"

Y_{n}=\prod _{i=1}^{n}{\frac {g(X_{i})}{f(X_{i})}}

If X is actually distributed according to the density f rather than according to g, then { Y_n : n = 1, 2, 3, ... } is a martingale with respect to { X_n : n = 1, 2, 3, ... }.

Suppose each amoeba either splits into two amoebas, with probability p, or eventually dies, with probability 1 − p. Let X_n be the number of amoebas surviving in the nth generation (in particular X_n = 0 if the population has become extinct by that time). Let r be the probability of eventual extinction. (Finding r as a function of p is an instructive exercise. Hint: The probability that the descendants of an amoeba eventually die out is equal to the probability that either of its immediate offspring dies out, given that the original amoeba has split.) Then

\{\,r^{X_{n}}:n=1,2,3,\dots \,\}

is a martingale with respect to { X_n: n = 1, 2, 3, ... }.

Software-created martingale series.

In an ecological community (a group of species that are in a particular trophic level, competing for similar resources in a local area), the number of individuals of any particular species of fixed size is a function of (discrete) time, and may be viewed as a sequence of random variables. This sequence is a martingale under the unified neutral theory of biodiversity and biogeography.
If { N_t : t ≥ 0 } is a Poisson process with intensity λ, then the compensated Poisson process { N_t − λt : t ≥ 0 } is a continuous-time martingale with right-continuous/left-limit sample paths.
Wald's martingale

Submartingales, supermartingales, and relationship to harmonic functions

There are two popular generalizations of a martingale that also include cases when the current observation X_n is not necessarily equal to the future conditional expectation E[X_n+1|X₁,...,X_n] but instead an upper or lower bound on the conditional expectation. These definitions reflect a relationship between martingale theory and potential theory, which is the study of harmonic functions. Just as a continuous-time martingale satisfies E[X_t|{X_τ : τ≤s}] − X_s = 0 ∀s ≤ t, a harmonic function f satisfies the partial differential equation Δf = 0 where Δ is the Laplacian operator. Given a Brownian motion process W_t and a harmonic function f, the resulting process f(W_t) is also a martingale.

A discrete-time submartingale is a sequence $X_{1},X_{2},X_{3},\ldots$ of integrable random variables satisfying

{}E[X_{n+1}|X_{1},\ldots ,X_{n}]\geq X_{n}.

Likewise, a continuous-time submartingale satisfies

{}E[X_{t}|\{X_{\tau }:\tau \leq s\}]\geq X_{s}\quad \forall s\leq t.

In potential theory, a subharmonic function f satisfies Δf ≥ 0. Any subharmonic function that is bounded above by a harmonic function for all points on the boundary of a ball are 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, the prefix "sub-" is consistent because the current observation X_n is less than (or equal to) the conditional expectation E[X_n₊₁|X₁,...,X_n]. Consequently, the current observation provides support from below the future conditional expectation, and the process tends to increase in future time.

Analogously, a discrete-time supermartingale satisfies

{}E[X_{n+1}|X_{1},\ldots ,X_{n}]\leq X_{n}.

Likewise, a continuous-time supermartingale satisfies

{}E[X_{t}|\{X_{\tau }:\tau \leq s\}]\leq X_{s}\quad \forall s\leq t.

In potential theory, a superharmonic function f satisfies Δf ≤ 0. Any superharmonic function that is bounded below by a harmonic function for all points on the boundary of a ball are 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 observation X_n is greater than (or equal to) the conditional expectation E[X_n₊₁|X₁,...,X_n]. Consequently, the current observation provides support from above the future conditional expectation, and the process tends to decrease in future time.

Examples of submartingales and supermartingales

Every martingale is also a submartingale and a supermartingale. Conversely, any stochastic process that is both 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 probability p.
- If p is equal to 1/2, the gambler on average neither wins nor loses money, and the gambler's fortune over time is a martingale.
- If p is less than 1/2, the gambler loses money on average, and the gambler's fortune over time is a supermartingale.
- If p is greater than 1/2, the gambler wins money on average, and the gambler's fortune over time is a submartingale.
A convex function of a martingale is a submartingale, by Jensen'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 that X_n² − n is a martingale). Similarly, a concave function of a martingale is a supermartingale.

Martingales and stopping times

A stopping time with respect to a sequence of random variables X₁, X₂, X₃, ... is a random variable τ with the property that for each t, the occurrence or non-occurrence of the event τ = t depends only on the values of X₁, X₂, X₃, ..., X_t. The intuition behind the definition is that at any particular time t, 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 his 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 of stopping time is defined by requiring only that the occurrence or non-occurrence of the event τ = t is probabilistically independent of X_t + 1, X_t + 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 $(X_{t})_{t>0}$ is a (sub-/super-) martingale and $\tau$ is a stopping time, then the corresponding stopped process $(X_{t}^{\tau })_{t>0}$ defined by $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, the optional stopping theorem which states that, under certain conditions, the expected value of a martingale at a stopping time is equal to its initial value.

Notes

↑ Balsara, N. J. (1992). Money Management Strategies for Futures Traders. Wiley Finance. p. 122. ISBN 0-471-52215-5.
↑ Mansuy, Roger (June 2009). "The origins of the Word "Martingale"" (PDF). Electronic Journal for History of Probability and Statistics. 5 (1). Retrieved 2011-10-22.
↑ Grimmett, G.; Stirzaker, D. (2001). Probability and Random Processes (3rd ed.). Oxford University Press. ISBN 0-19-857223-9.

References

Hazewinkel, Michiel, ed. (2001) [1994], "Martingale", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
"The Splendors and Miseries of Martingales". Electronic Journal for History of Probability and Statistics. 5 (1). June 2009. Entire issue dedicated to Martingale probability theory.
Williams, David (1991). Probability with Martingales. Cambridge University Press. ISBN 0-521-40605-6.
Kleinert, Hagen (2004). Path Integrals in Quantum Mechanics, Statistics, Polymer Physics, and Financial Markets (4th ed.). Singapore: World Scientific. ISBN 981-238-107-4.
Siminelakis, Paris (2010). "Martingales and Stopping Times: Use of martingales in obtaining bounds and analyzing algorithms" (PDF). University of Athens.
Ville, Jean (1939). Étude critique de la notion de collectif. Monographies des Probabilités (in French). 3. Paris: Gauthier-Villars. Zbl 0021.14601. Review by Doob.

Stochastic processes
Discrete time	Bernoulli process Branching process Chinese restaurant process Galton–Watson process Independent and identically distributed random variables Markov chain Moran process Random walk Loop-erased Self-avoiding Biased Maximal entropy
Continuous time	Bessel process Birth–death process Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Empirical process Feller process Fleming–Viot process Gamma process Hunt process Interacting particle systems Itô diffusion Itô process Jump diffusion Jump process Lévy process Local time Markov additive process McKean–Vlasov process Ornstein–Uhlenbeck process Poisson process Compound Non-homogeneous Point process Schramm–Loewner evolution Semimartingale Sigma-martingale Stable process Superprocess Telegraph process Variance gamma process Wiener process Wiener sausage
Both	Branching process Galves–Löcherbach model Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process Stochastic chains with memory of variable length White noise
Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Potts model Boolean network Markov random field Percolation Pitman–Yor process Point process Cox Poisson Random field Random graph
Time series models	Autoregressive conditional heteroskedasticity (ARCH) model Autoregressive integrated moving average (ARIMA) model Autoregressive (AR) model Autoregressive–moving-average (ARMA) model Generalized autoregressive conditional heteroskedasticity (GARCH) model Moving-average (MA) model
Financial models	Black–Derman–Toy Black–Karasinski Black–Scholes Chen Constant elasticity of variance (CEV) Cox–Ingersoll–Ross (CIR) Garman–Kohlhagen Heath–Jarrow–Morton (HJM) Heston Ho–Lee Hull–White LIBOR market Rendleman–Bartter SABR volatility Vašíček Wilkie
Actuarial models	Bühlmann Cramér–Lundberg Risk process Sparre–Anderson
Queueing models	Bulk Fluid Generalized queueing network M/G/1 M/M/1 M/M/c
Properties	Càdlàg paths Continuous Continuous paths Ergodic Exchangeable Feller-continuous Gauss–Markov Markov Mixing Piecewise deterministic Predictable Progressively measurable Self-similar Stationary Time-reversible
Limit theorems	Central limit theorem Donsker's theorem Doob's martingale convergence theorems Ergodic theorem Fisher–Tippett–Gnedenko theorem Large deviation principle Law of large numbers (weak/strong) Law of the iterated logarithm Maximal ergodic theorem Sanov's theorem
Inequalities	Burkholder–Davis–Gundy Doob's martingale Kunita–Watanabe
Tools	Cameron–Martin formula Convergence of random variables Doléans-Dade exponential Doob decomposition theorem Doob–Meyer decomposition theorem Doob's optional stopping theorem Dynkin's formula Feynman–Kac formula Filtration Girsanov theorem Infinitesimal generator Itô integral Itô's lemma Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prokhorov's theorem Quadratic variation Reflection principle Skorokhod integral Skorokhod's representation theorem Skorokhod space Snell envelope Stochastic differential equation Tanaka Stopping time Stratonovich integral Uniform integrability Usual hypotheses Wiener space Classical Abstract
Disciplines	Actuarial mathematics Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Statistics Stochastic analysis Time series analysis Machine learning
List of topics Category

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.