Searcharxiv⌕ Search

arXiv subjects

Andreas Neuenkirch

Publications and source records attributed to Andreas Neuenkirch.

27 records · Page 2Linked to original sources

First order strong approximations of scalar SDEs with values in a domain

We are interested in strong approximations of one-dimensional SDEs which have non-Lipschitz coefficients and which take values in a domain. Under a set of general assumptions we derive an implicit scheme that preserves the domain of the SDEs and is strongly convergent with rate one. Moreover, we show that this general result can be applied to many SDEs we encounter in mathematical finance and bio-mathematics. We will demonstrate flexibility of our approach by analysing classical examples of SDEs with sublinear coefficients (CIR, CEV models and Wright-Fisher diffusion) and also with superlinear coefficients (3/2-volatility, Ait-Sahalia model). Our goal is to justify an efficient Multi-Level Monte Carlo (MLMC) method for a rich family of SDEs, which relies on good strong convergence properties.

q-fin.CP↗

Convergence of numerical methods for stochastic differential equations in mathematical finance

Many stochastic differential equations that occur in financial modelling do not satisfy the standard assumptions made in convergence proofs of numerical schemes that are given in textbooks, i.e., their coefficients and the corresponding derivatives appearing in the proofs are not uniformly bounded and hence, in particular, not globally Lipschitz. Specific examples are the Heston and Cox-Ingersoll-Ross models with square root coefficients and the Ait-Sahalia model with rational coefficient functions. Simple examples show that, for example, the Euler-Maruyama scheme may not converge either in the strong or weak sense when the standard assumptions do not hold. Nevertheless, new convergence results have been obtained recently for many such models in financial mathematics. These are reviewed here. Although weak convergence is of traditional importance in financial mathematics with its emphasis on expectations of functionals of the solutions, strong convergence plays a crucial role in Multi Level Monte Carlo methods, so it and also pathwise convergence will be considered along with methods which preserve the positivity of the solutions.

math.NA↗

A least square-type procedure for parameter estimation in stochastic differential equations with additive fractional noise

We study a least square-type estimator for an unknown parameter in the drift coefficient of a stochastic differential equation with additive fractional noise of Hurst parameter H>1/2. The estimator is based on discrete time observations of the stochastic differential equation, and using tools from ergodic theory and stochastic analysis we derive its strong consistency.

math.PR↗

A Milstein-type scheme without Levy area terms for SDEs driven by fractional Brownian motion

In this article, we study the numerical approximation of stochastic differential equations driven by a multidimensional fractional Brownian motion (fBm) with Hurst parameter greater than 1/3. We introduce an implementable scheme for these equations, which is based on a second order Taylor expansion, where the usual Levy area terms are replaced by products of increments of the driving fBm. The convergence of our scheme is shown by means of a combination of rough paths techniques and error bounds for the discretisation of the Levy area terms.

math.PR↗

Discretizing the fractional Levy area

In this article, we give sharp bounds for the Euler- and trapezoidal discretization of the Levy area associated to a d-dimensional fractional Brownian motion. We show that there are three different regimes for the exact root mean-square convergence rate of the Euler scheme. For H<3/4 the exact convergence rate is n^{-2H+1/2}, where n denotes the number of the discretization subintervals, while for H=3/4 it is n^{-1} (log(n))^{1/2} and for H>3/4 the exact rate is n^{-1}. Moreover, the trapezoidal scheme has exact convergence rate n^{-2H+1/2} for H>1/2. Finally, we also derive the asymptotic error distribution of the Euler scheme. For H lesser than 3/4 one obtains a Gaussian limit, while for H>3/4 the limit distribution is of Rosenblatt type.

math.PR↗

Delay equations driven by rough paths

In this article, we illustrate the flexibility of the algebraic integration formalism introduced by M. Gubinelli (2004), by establishing an existence and uniqueness result for delay equations driven by rough paths. We then apply our results to the case where the driving path is a fractional Brownian motion with Hurst parameter H>1/3.

math.PR↗

Optimal pointwise approximation of stochastic differential equations driven by fractional Brownian motion

We study the approximation of stochastic differential equations driven by a fractional Brownian motion with Hurst parameter $H>1/2$. For the mean-square error at a single point we derive the optimal rate of convergence that can be achieved by any approximation method using an equidistant discretization of the driving fractional Brownian motion. We find that there are mainly two cases: either the solution can be approximated perfectly or the best possible rate of convergence is $n^{-H-1/2},$ where $n$ denotes the number of evaluations of the fractional Brownian motion. In addition, we present an implementable approximation scheme that obtains the optimal rate of convergence in the latter case.

math.PR↗

Trees and asymptotic developments for fractional stochastic differential equations

In this paper we consider a n-dimensional stochastic differential equation driven by a fractional Brownian motion with Hurst parameter H>1/3. After solving this equation in a rather elementary way, following the approach of Gubinelli, we show how to obtain an expansion for E[f(X\_t)] in terms of t, where X denotes the solution to the SDE and f:R^n->R is a regular function. With respect to the work by Baudoin and Coutin, where the same kind of problem is considered, we try an improvement in three different directions: we are able to take a drift into account in the equation, we parametrize our expansion with trees (which makes it easier to use), and we obtain a sharp control of the remainder.

math.PR↗