Fractional Brownian motion
In probability theory, a normalized fractional Brownian motion (fBm), also called a fractal Brownian motion, is a continuous-time Gaussian process BH(t) on [0, T], which starts at zero, has expectation zero for all t in [0, T], and has the following covariance function:
where H is a real number in (0, 1), called the Hurst index or Hurst parameter associated with the fractional Brownian motion. It was introduced by Mandelbrot & van Ness (1968).
The value of H determines what kind of process the fBm is:
- if H = 1/2 then the process is in fact a Brownian motion or Wiener process;
- if H > 1/2 then the increments of the process are positively correlated;
- if H < 1/2 then the increments of the process are negatively correlated.
The increment process, X(t) = BH(t+1) − BH(t), is known as fractional Gaussian noise.
Contents |
[edit] Background and definition
Prior to the introduction of the fractional Brownian motion, Lévy (1953) used the Riemann–Liouville fractional integral to define the process
where integration is with respect to the white noise measure dB(s). This integral turns out to be ill-suited to applications of fractional Brownian motion because of its over-emphasis of the origin (Mandelbrot & van Ness 1968, p. 424).
The idea instead is to use a different fractional integral of white noise to define the process: the Weyl integral
for t > 0 (and similarly for t < 0).
[edit] Properties
[edit] Self-similarity
The process is self-similar, since in terms of probability distributions:
- BH(at)∼ | a | HBH(t).
Fractional Brownian motion is the only self-similar Gaussian process.
[edit] Stationary increments
It has stationary increments:
[edit] Long-range dependence
For H > ½ the process exhibits long-range dependence,
[edit] Regularity
Sample-paths are almost nowhere differentiable. However, almost-all trajectories are Hölder continuous of any order strictly less than H: for each such trajectory, there exists a constant c such that
for every ε > 0.
[edit] Dimension
With probability 1, the graph of BH(t) has both Hausdorff dimension and box dimension of 2−H.
[edit] Integration
As for regular Brownian motion, one can define stochastic integrals with respect to fractional Brownian motion, usually called "fractional stochastic integrals". In general though, unlike integrals with respect to regular Brownian motion, fractional stochastic integrals are not Semimartingales.
[edit] Sample paths
Practical computer realisations of an fBm can be generated, although they are only a finite approximation. The sample paths chosen can be thought of as showing discrete sampled points on an fBm process. Three realisations are shown below, each with 1000 points of an fBm with Hurst parameter 0.75.
| H = 0.75 realisation 1 | H = 0.75 realisation 2 | H = 0.75 realisation 3 |
Two realisations are shown below, each showing 1000 points of an fBm, the first with Hurst parameter 0.95 and the second with Hurst parameter 0.55.
| H = 0.95 | H = 0.55 |
[edit] Method 1 of simulation
One can simulate sample-paths of an fBm as any Gaussian process of known covariance. Suppose we want to simulate the values of the fBM at times
.
- Form the matrix
where
.
- Compute
the square root matrix of
, i.e.
. Loosely speaking,
is the "standard deviation" matrix associated to the variance-covariance matrix
.
- Construct a vector
of n numbers drawn according a standard Gaussian distribution,
- If we define
then
yields a sample path of an fBm.
In order to compute
, we can use for instance the Cholesky decomposition method. An alternative method uses the eigenvalues of
:
- Since
is symmetric, positive-definite matrix, it follows that all eigenvalues
of
satisfy
, (
).
- Let
be the diagonal matrix of the eigenvalues, i.e.
where δij is the Kronecker delta. We define Λ1 / 2 as the diagonal matrix with entries
, i.e.
.
Note that this makes sense because
.
- Let
an eigenvector associated to the eigenvalue
. Define
as the matrix whose i-th column is the eigenvector
.
Note that since the eigenvectors are linearly independent, the matrix
is inversible.
- It follows then that
because
.
[edit] Method 2 of simulation
It is also known that
where B is a standard Brownian motion and
Where 2F1 is the Euler hypergeometric integral.
Say we want simulate an fBm at points
.
- Construct a vector of n numbers drawn according a standard Gaussian distribution.
- Multiply it component-wise by √(T/n) to obtain the increments of a Brownian motion on [0, T]. Denote this vector by
.
- For each tj, compute
The integral may be efficiently computed by Gaussian quadrature. Hypergeometric functions are part of the GNU scientific library.
[edit] See also
- Brownian surface
- Autoregressive fractionally integrated moving average
- Multifractal: The generalized framework of fractional Brownian motions.
- Pink noise
[edit] References
- Beran, J. (1994), Statistics for Long-Memory Processes, Chapman & Hall, ISBN 0-412-04901-5.
- Lévy, P. (1953), Random functions: General theory with special references to Laplacian random functions, University of California Publications in Statistics, 1, pp. 331–390.
- Mandelbrot, B.; van Ness, J.W. (1968), "Fractional Brownian motions, fractional noises and applications", SIAM Review 10 (4): 422–437, JSTOR 2027184.
- Samorodnitsky G., Taqqu M.S. (1994), Stable Non-Gaussian Random Processes, Chapter 7: "Self-similar processes" (Chapman & Hall).
![E[B_H(t) B_H (s)]=\frac{1}{2} (|t|^{2H}+|s|^{2H}-|t-s|^{2H}),](http://upload.wikimedia.org/wikipedia/en/math/9/d/f/9df1180d818e9f2ede6777a13233d692.png)

![B_H (t) = B_H (0) + \frac{1}{\Gamma(H+1/2)}\left\{\int_{-\infty}^0\left[(t-s)^{H-1/2}-(-s)^{H-1/2}\right]\,dB(s) + \int_0^t (t-s)^{H-1/2}\,dB(s)\right\}](http://upload.wikimedia.org/wikipedia/en/math/2/b/5/2b56d2d63e30be61ab3cc9924e18e441.png)

![\sum_{n=1}^\infty E[B_H (1)(B_H (n+1)-B_H (n))] = \infty.](http://upload.wikimedia.org/wikipedia/en/math/8/9/8/898a34a007a942a660166ebf5b9ef378.png)

where
.
. Loosely speaking,
of n numbers drawn according a standard Gaussian distribution,
then
yields a sample path of an fBm.
of
, (
).
be the diagonal matrix of the eigenvalues, i.e.
where
, i.e.
.
an eigenvector associated to the eigenvalue
because
.

.