• Corpus ID: 119142430

# $\epsilon$-Strong Simulation of Fractional Brownian Motion and Related Stochastic Differential Equations

@article{Chen2019epsilonStrongSO,
title={\$\epsilon\$-Strong Simulation of Fractional Brownian Motion and Related Stochastic Differential Equations},
author={Yi Chen and Jing Dong and Hao Ni},
journal={arXiv: Probability},
year={2019}
}
• Published 21 February 2019
• Computer Science, Mathematics
• arXiv: Probability
Consider the fractional Brownian Motion (fBM) $B^H=\{B^H(t): t \in [0,1] \}$ with Hurst index $H\in (0,1)$. We construct a probability space supporting both $B^H$ and a fully simulatable process $\hat B_{\epsilon}^H$ such that $$\sup_{t\in [0,1]}|B^H(t)-\hat B_{\epsilon}^H(t)| \le \epsilon$$ with probability one for any user specified error parameter $\epsilon>0$. When $H>1/2$, we further enhance our error guarantee to the $\alpha$-Holder norm for any $\alpha \in (1/2,H)$. This enables us to…
1 Citations

## Figures and Tables from this paper

### $\varepsilon$-strong simulation of the convex minorants of stable processes and meanders

• Mathematics
• 2019
Using marked Dirichlet processes we characterise the law of the convex minorant of the meander for a certain class of L\'evy processes, which includes subordinated stable and symmetric L\'evy

## References

SHOWING 1-10 OF 52 REFERENCES

### Rate of convergence and asymptotic error distribution of Euler approximation schemes for fractional diffusions

• Mathematics
• 2016
For a stochastic differential equation(SDE) driven by a fractional Brownian motion(fBm) with Hurst parameter $H>\frac{1}{2}$, it is known that the existing (naive) Euler scheme has the rate of

### On Optimal Exact Simulation of Max-Stable and Related Random Fields

• Mathematics, Computer Science
• 2016
The random field M(t) is considered, for a set $T\subset \mathbb{R}^{m}$, where $(X_{n})$ is an iid sequence of centered Gaussian random fields on $T$ and $0 0$ with complexity $o(c(d)\,d^{\epsilon })$, where $M$ can be a.s. converging series representation.

### Fast and Exact Simulation of Stationary Gaussian Processes through Circulant Embedding of the Covariance Matrix

• Computer Science
SIAM J. Sci. Comput.
• 1997
This paper shows that for many important correlation functions in geostatistics, realizations of the associated process over $m+1$ equispaced points on a line can be produced at the cost of an initial FFT of length $2m$ with each new realization requiring an additionalFFT of the same length.

### ε-STRONG SIMULATION FOR MULTIDIMENSIONAL STOCHASTIC DIFFERENTIAL EQUATIONS VIA ROUGH PATH ANALYSIS By

• Mathematics
• 2014
Consider a multidimensional diffusion process X = {X (t) : t ∈ [0, 1]}. Let ε > 0 be a deterministic, user defined, tolerance error parameter. Under standard regularity conditions on the drift and

### Exact Rate of Convergence of Some Approximation Schemes Associated to SDEs Driven by a Fractional Brownian Motion

• Mathematics
• 2006
Abstract In this article, we derive the exact rate of convergence of some approximation schemes associated to scalar stochastic differential equations driven by a fractional Brownian motion with

### Optimal series representation of fractional Brownian sheets

• Mathematics
• 2002
For 0 < γ < 2 let B γ be a d–dimensional γ–fractional Brownian sheet with index set [0, 1] and let (ξk)k≥1 be an i.i.d. sequence of standard normal random variables. We prove the existence of

### ON SPECTRAL SIMULATION OF FRACTIONAL BROWNIAN MOTION

• Mathematics
Probability in the Engineering and Informational Sciences
• 2003
This article focuses on simulating fractional Brownian motion (fBm). Despite the availability of several exact simulation methods, attention has been paid to approximate simulation (i.e., the output

### ε-Strong simulation of the Brownian path

• Computer Science, Mathematics
• 2011
An iterative sampling method which delivers upper and lower bounding processes for the Brownian path and shows analytical results from applications of the e -strong algorithm for estimating expectations arising in option pricing.

### Di erential equations driven by rough signals

This paper aims to provide a systematic approach to the treatment of differential equations of the type dyt = Si fi(yt) dxti where the driving signal xt is a rough path. Such equations are very

### Nearly Optimal Bernoulli Factories for Linear Functions

• M. Huber
• Mathematics, Computer Science
Combinatorics, Probability and Computing
• 2016
This paper presents the first Bernoulli factory for f(p) = Cp with bounds on $\mathbb{E}[T]$ as a function of the input parameters, which is optimal up to a constant in the running time.