Fractional Brownian motion

A normalized fractional Brownian motion (denoted fBm) B^H(t) on is a continuous-time Gaussian process starting at zero, with mean zero, and having the following covariance function:

where H, called the Hurst index or Hurst parameter associated to the fractional Brownian motion, is a real number in [0,1].

The value of H determines what kind of process the fBm is:

• if H = 1 / 2, the process is in fact a regular Brownian motion;
• if H > 1 / 2, the increments of the process are positively correlated;
• if H < 1 / 2, the increments of the process are negatively correlated.

Contents 1 Properties 1.1 Self-similarity 1.2 Stationary increments 1.3 Long-range dependence 1.4 Regularity 1.5 Integration 2 Sample paths 2.1 Method 1 of simulation 2.2 Method 2 of simulation 3 See also 4 References

Properties

Self-similarity

The process is said to be self-similar, since in terms of distributions:

Stationary increments

It has stationary increments:

Long-range dependence

For H > 1 / 2, the process exhibits long-range dependence, which means that

Regularity

Sample-paths are almost nowhere differentiable. However, almost-all trajectories are Hölder continuous of any order strictly less than H: for each trajectory, there exists a constant c such that

for any .

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 Martingales.

Sample paths

Practical computer realisations of fBm can be generated, although obviously they cannot really be fractal. 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 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 fBm, the first with Hurst parameter 0.95 and the second with Hurst parameter 0.55.

H=0.95	H=0.55

Method 1 of simulation

One can simulate sample-paths of fBm as any Gaussian process of known covariance. Say we aim to have simulated values at .

• Form the matrix where R(t,s) = (s^2H + t^2H − | t − s | ^2H) / 2.

• Compute a square root of Γ, say σ. Use for instance the Cholesky decomposition method.

• Construct a vector of n numbers drawn according a standard gaussian distribution.

• Apply σ to this vector yields a sample-path of fBm.

Method 2 of simulation

It is also known that where B is a standard Brownian motion and

Where ₂F₁ is the Euler Hypergeometric integral.

Say we want simulate fBm at points .

• Construct a vector of n numbers drawn according a standard gaussian distribution.

• Multiply it component-wise by sqrt(T/n) to obtain the increments of a Brownian motion on [0,T]. Denote this vector by .

• For each t_j, compute

The integral may be efficiently computed by Gaussian quadrature. Hypergeometric functions are part of the GNU scientific library .

See also

• Multifractal: The generalized framework of fBm.
• Pink noise

References

• Beran, J. (1994) Statistics for Long-Memory Processes, Chapman & Hall. ISBN 0-412-04901-5.