Brownian web paths from a random space time point. The introduction of this topology allowed them to prove the convergence of the coalescing random walks to a unique limiting object and characterize it. They named this limiting object Brownian web. An extension of the Brownian web, called the Brownian net, has been introduced by Sun and Swart by allowing the coalescing Brownian motions to undergo branching. An alternative construction of the Brownian net was given by Newman, Ravishankar and Schertzer. For a recent survey, see Schertzer, Sun and Swart. Brownian web In probability theory, the Brownian web is an uncountable collection of
Fractional Brownian motion Suppose we want to simulate the values of the "fBM" at times formula_12 using the Cholesky decomposition method. In order to compute formula_15, we can use for instance the Cholesky decomposition method. An alternative method uses the eigenvalues of formula_16: Note that the result is real-valued because formula_36. Note that since the eigenvectors are linearly independent, the matrix formula_39 is invertible. It is also known that where "B" is a standard Brownian motion and Where formula_47 is the Euler hypergeometric integral. Say we want to simulate an "fBm" at points formula_48. The integral may be efficiently computed by Gaussian quadrature.