Fractional Brownian motion

From Wikipedia, the free encyclopedia

In probability theory, fractional Brownian motion (fBm), also called a fractal Brownian motion, is a generalization of Brownian motion. Unlike classical Brownian motion, the increments of fBm need not be independent. fBm is a continuous-time Gaussian process on , that starts at zero, has expectation zero for all in , 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. The Hurst exponent describes the raggedness of the resultant motion, with a higher value leading to a smoother 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.

Fractional Brownian motion has stationary increments X(t) = BH(s+t) − BH(s) (the value is the same for any s). The increment process X(t) is known as fractional Gaussian noise.

There is also a generalization of fractional Brownian motion: n-th order fractional Brownian motion, abbreviated as n-fBm.[1] n-fBm is a Gaussian, self-similar, non-stationary process whose increments of order n are stationary. For n = 1, n-fBm is classical fBm.

Like the Brownian motion that it generalizes, fractional Brownian motion is named after 19th century biologist Robert Brown; fractional Gaussian noise is named after mathematician Carl Friedrich Gauss.

Background and definition[edit]

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 as a definition of fractional Brownian motion because of its over-emphasis of the origin (Mandelbrot & van Ness 1968, p. 424). It does not have stationary increments.

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). The resulting process has stationary increments.

The main difference between fractional Brownian motion and regular Brownian motion is that while the increments in Brownian Motion are independent, increments for fractional Brownian motion are not. If H > 1/2, then there is positive autocorrelation: if there is an increasing pattern in the previous steps, then it is likely that the current step will be increasing as well. If H < 1/2, the autocorrelation is negative.



The process is self-similar, since in terms of probability distributions:

This property is due to the fact that the covariance function is homogeneous of order 2H and can be considered as a fractal property. FBm can also be defined as the unique mean-zero Gaussian process, null at the origin, with stationary and self-similar increments.

Stationary increments[edit]

It has stationary increments:

Long-range dependence[edit]

For H > ½ the process exhibits long-range dependence,


Sample-paths are almost nowhere differentiable. However, almost-all trajectories are locally Hölder continuous of any order strictly less than H: for each such trajectory, for every T > 0 and for every ε > 0 there exists a (random) constant c such that

for 0 < s,t < T.


With probability 1, the graph of BH(t) has both Hausdorff dimension[2] and box dimension[3] of 2−H.


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.

Frequency-domain interpretation[edit]

Just as Brownian motion can be viewed as white noise filtered by (i.e. integrated), fractional Brownian motion is white noise filtered by (corresponding to fractional integration).

Sample paths[edit]

Practical computer realisations of an fBm can be generated,[4] 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 realizations 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

Realizations of three different types of fBm are shown below, each showing 1000 points, the first with Hurst parameter 0.15, the second with Hurst parameter 0.55, and the third with Hurst parameter 0.95. The higher the Hurst parameter is, the smoother the curve will be.

"H" = 0.15
"H" = 0.55
"H" = 0.95

Method 1 of simulation[edit]

One can simulate sample-paths of an fBm using methods for generating stationary Gaussian processes with known covariance function. The simplest method relies on the Cholesky decomposition method of the covariance matrix (explained below), which on a grid of size has complexity of order . A more complex, but computationally faster method is the circulant embedding method of Dietrich & Newsam (1997).

Suppose we want to simulate the values of the fBM at times using the Cholesky decomposition method.

  • 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 independently according to 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 is the Kronecker delta. We define as the diagonal matrix with entries , i.e. .

Note that the result is real-valued because .

  • Let an eigenvector associated to the eigenvalue . Define as the matrix whose -th column is the eigenvector .

Note that since the eigenvectors are linearly independent, the matrix is invertible.

  • It follows then that because .

Method 2 of simulation[edit]

It is also known that [5]

where B is a standard Brownian motion and

Where is the Euler hypergeometric integral.

Say we want to simulate an fBm at points .

  • Construct a vector of n numbers drawn according to 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 , compute

The integral may be efficiently computed by Gaussian quadrature.

See also[edit]


  1. ^ Perrin et al., 2001.
  2. ^ Orey, 1970.
  3. ^ Falconer, Kenneth (2003). Fractal Geometry Mathematical Foundations and Applications (2 ed.). Wiley. p. 268. ISBN 0-470-84861-8. Retrieved 23 January 2024.
  4. ^ Kroese, D.P.; Botev, Z.I. (2014). "Spatial Process Generation". Lectures on Stochastic Geometry, Spatial Statistics and Random Fields, Volume II: Analysis, Modeling and Simulation of Complex Structures, Springer-Verlag, Berlin. arXiv:1308.0399. Bibcode:2013arXiv1308.0399K.
  5. ^ Decreusefond, Laurent; Üstünel, Ali Süleyman (1999). "Stochastic analysis of the fractional Brownian motion". Potential Analysis. 10 (2): 177–214. doi:10.1023/A:1008634027843.


Further reading[edit]