Quadratic variation

Quadratic variation

In mathematics, quadratic variation is used in the analysis of stochastic processes such as Brownian motion and martingales. Quadratic variation is just one kind of variation of a process.

Definition

Suppose that "X""t" is a real-valued stochastic process defined on a probability space (Ω,F,P) and with time index "t" ranging over the non-negative real numbers. Its quadratic variation is the process, written as ["X"] "t", defined as: [X] _t=lim_{Vert PVert ightarrow 0}sum_{k=1}^n(X_{t_k}-X_{t_{k-1)^2where "P" ranges over partitions of the interval [0,"t"] and the norm of the partition "P" is the mesh. This limit, if it exists, is defined using convergence in probability.

More generally, the "quadratic covariation" of two processes "X" and "Y" is: [X,Y] _t = lim_{Vert PVert o 0}sum_{k=1}^{n}left(X_{t_k}-X_{t_{k-1 ight)left(Y_{t_k}-Y_{t_{k-1 ight).The quadratic covariation may be written in terms of the quadratic variation by the polarization identity:: [X,Y] _t=frac{1}{4}( [X+Y] _t- [X-Y] _t).

Finite variation processes

A process "X" is said to have "finite variation" if it is has bounded variation over every finite time interval (with probability 1). Such processes are very common including, in particular, all continuously differentiable functions. The quadratic variation exists for all continuous finite variation processes, and is zero.

This statement can be generalized to non-continuous processes. Any càdlàg finite variation process "X" has quadratic variation equal to the sum of the squares of the jumps of "X". To state this more precisely, the left limit of "X""t" with respect to "t" is denoted by "X""t"-, and the jump of "X" at time "t" can be written as Δ"X""t" = "X""t" - "X""t"-. Then, the quadratic variation is given by: [X] _t=sum_{0

The proof that continuous finite variation processes have zero quadratic variation follows from the following inequality. Here, "P" is a partition of the interval [0,"t"] , and "V""t"("X") is the variation of "X" over [0,"t"] .:egin{align}sum_{k=1}^n(X_{t_k}-X_{t_{k-1)^2&lemax_{kle n}|X_{t_k}-X_{t_{k-1|sum_{k=1}^n|X_{t_k}-X_{t_{k-1|\&lemax_{|u-v|leVert PVert}|X_u-X_v|V_t(X)end{align}By the continuity of "X", this vanishes in the limit as ||"P"|| goes to zero.

Itō processes

The quadratic variation of a standard Brownian motion "B" exists, and is given by ["B"] "t" = "t". This generalizes to Itō processes which, by definition, can be expressed in terms of Itō integrals: X_t = X_0 + int_0^tsigma_s,dB_s + int_0^tmu_s,ds,where "B" is a Brownian motion. Any such process has quadratic variation given by: [X] _t=int_0^tsigma_s^2,ds.

Semimartingales

Quadratic variations and covariations of all semimartingales can be shown to exist. They form an important part of the theory of stochastic calculus, appearing in Itō's lemma, which is the generalization of the the chain rule to the Itō integral. The quadratic covariation also appears in the integration by parts formula:X_tY_t=X_0Y_0+int_0^tX_{s-},dY_s + int_0^tY_{s-},dX_s+ [X,Y] _t,which can be used to compute ["X","Y"] .

Martingales

All càdlàg martingales, and local martingales have well defined quadratic variation, which follows from the fact that such processes are examples of semimartingales.It can be shown that the quadratic variation ["M"] of a general local martingale "M" is the unique right-continuous and increasing process starting at zero, with jumps Δ ["M"] = Δ"M"2, and such that "M"2 - ["M"] is a local martingale.

A useful result for square integrable martingales is the Itō isometry, which can be used to calculate the variance of Ito integrals,:mathbb{E}left(left(int_0^t H,dM ight)^2 ight) = mathbb{E}left(int_0^tH^2,d [M] ight).This result holds whenever "M" is a càdlàg square integrable martingale and "H" is a bounded predictable process, and is often used in the construction of the Itō integral.

Another important result is the Burkholder-Davis-Gundy inequality. This gives bounds for the maximum of a martingale in terms of the quadratic variation. For a local martingale "M" starting at zero, with maximum denoted by "M""t"* &equiv;sups&le;"t"|"M""s"|, and any real number "p" &ge;1, the inequality is:c_pmathbb{E}( [M] _t^{p/2})le mathbb{E}((M^*_t)^p)le C_pmathbb{E}( [M] _t^{p/2}).Here, "c""p" < "C""p" are constants depending on the choice of "p", but not depending on the martingale "M" or time "t" used. If "M" is a continuous local martingale, then the Burkholder-Davis-Gundy inequality holds for any positive value of "p".

An alternative process, the predictable quadratic variation is sometimes used for locally square integrable martingales. This is written as <"M">"t", and is defined to be the unique right-continuous and increasing predictable process starting at zero such that "M"2 - <"M"> is a local martingale. Its existence follows from the Doob-Meyer decomposition theorem and, for continuous local martingales, it is the same as the quadratic variation.

See also

* Total variation, Bounded variation

References

*Citation|last=Protter|first=Philip E.|year=2004|title=Stochastic Integration and Differential Equations|publisher=Springer|edition=2nd|isbn=3-540-00313-4


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Quadratic — In mathematics, the term quadratic describes something that pertains to squares, to the operation of squaring, to terms of the second degree, or equations or formulas that involve such terms. Quadratus is Latin for square . Mathematics Algebra… …   Wikipedia

  • Quadratic equation — This article is about quadratic equations and solutions. For more general information about quadratic functions, see Quadratic function. For more information about quadratic polynomials, see Quadratic polynomial. In mathematics, a quadratic… …   Wikipedia

  • Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

  • Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   Wikipedia

  • Total variation — As the green ball travels on the graph of the given function, the length of the path travelled by that ball s projection on the y axis, shown as a red ball, is the total variation of the function. In mathematics, the total variation identifies… …   Wikipedia

  • Itō calculus — Itō calculus, named after Kiyoshi Itō, extends the methods of calculus to stochastic processes such as Brownian motion (Wiener process). It has important applications in mathematical finance and stochastic differential equations.The central… …   Wikipedia

  • List of mathematics articles (Q) — NOTOC Q Q analog Q analysis Q derivative Q difference polynomial Q exponential Q factor Q Pochhammer symbol Q Q plot Q statistic Q systems Q test Q theta function Q Vandermonde identity Q.E.D. QED project QR algorithm QR decomposition Quadratic… …   Wikipedia

  • Wiener process — In mathematics, the Wiener process is a continuous time stochastic process named in honor of Norbert Wiener. It is often called Brownian motion, after Robert Brown. It is one of the best known Lévy processes (càdlàg stochastic processes with… …   Wikipedia

  • Semimartingale — In probability theory, a real valued process X is called a semimartingale if it can be decomposed as the sum of a local martingale and an adapted finite variation process.Semimartingales are good integrators , forming the largest class of… …   Wikipedia

  • Two-line elements — Orbital parameter for the SGP4 model (or one of the SGP8, SDP4, SDP8 models) are determined for many thousands of space objects by NORAD and are freely distributed on the Internet in the form of TLEs by Celestrak (http://celestrak.com/). Here the …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”