arXiv subjects

Ahmed Kebaier

Publications and source records attributed to Ahmed Kebaier.

24 records · Page 2Linked to original sources

arXiv2017

Asymptotic properties of maximum likelihood estimator for the growth rate for a jump-type CIR process based on continuous time observations

We consider a jump-type Cox--Ingersoll--Ross (CIR) process driven by a standard Wiener process and a subordinator, and we study asymptotic properties of the maximum likelihood estimator (MLE) for its growth rate. We distinguish three cases: subcritical, critical and supercritical. In the subcritical case we prove weak consistency and asymptotic normality, and, under an additional moment assumption, strong consistency as well. In the supercritical case, we prove strong consistency and mixed normal (but non-normal) asymptotic behavior, while in the critical case, weak consistency and non-standard asymptotic behavior are described. We specialize our results to so-called basic affine jump-diffusions as well. Concerning the asymptotic behavior of the MLE in the supercritical case, we derive a stochastic representation of the limiting mixed normal distribution, where the almost sure limit of an appropriately scaled jump-type supercritical CIR process comes into play. This is a new phenomenon, compared to the critical case, where a diffusion-type critical CIR process plays a role.

math.ST↗

arXiv2017

Coupling Importance Sampling and Multilevel Monte Carlo using Sample Average Approximation

In this work, we propose a smart idea to couple importance sampling and Multilevel Monte Carlo (MLMC). We advocate a per level approach with as many importance sampling parameters as the number of levels, which enables us to compute the different levels independently. The search for parameters is carried out using sample average approximation, which basically consists in applying deterministic optimisation techniques to a Monte Carlo approximation rather than resorting to stochastic approximation. Our innovative estimator leads to a robust and efficient procedure reducing both the discretization error (the bias) and the variance for a given computational effort. In the setting of discretized diffusions, we prove that our estimator satisfies a strong law of large numbers and a central limit theorem with optimal limiting variance, in the sense that this is the variance achieved by the best importance sampling measure (among the class of changes we consider), which is however non tractable. Finally, we illustrate the efficiency of our method on several numerical challenges coming from quantitative finance and show that it outperforms the standard MLMC estimator.

math.PR↗

arXiv2016

Maximum Likelihood Estimation for Wishart processes

In the last decade, there has been a growing interest to use Wishart processes for modelling, especially for financial applications. However, there are still few studies on the estimation of its parameters. Here, we study the Maximum Likelihood Estimator (MLE) in order to estimate the drift parameters of a Wishart process. We obtain precise convergence rates and limits for this estimator in the ergodic case and in some nonergodic cases. We check that the MLE achieves the optimal convergence rate in each case. Motivated by this study, we also present new results on the Laplace transform that extend the recent findings of Gnoatto and Grasselli and are of independent interest.

math.ST↗

arXiv2015

Central limit theorem for the multilevel Monte Carlo Euler method

This paper focuses on studying the multilevel Monte Carlo method recently introduced by Giles [Oper. Res. 56 (2008) 607-617] which is significantly more efficient than the classical Monte Carlo one. Our aim is to prove a central limit theorem of Lindeberg-Feller type for the multilevel Monte Carlo method associated with the Euler discretization scheme. To do so, we prove first a stable law convergence theorem, in the spirit of Jacod and Protter [Ann. Probab. 26 (1998) 267-307], for the Euler scheme error on two consecutive levels of the algorithm. This leads to an accurate description of the optimal choice of parameters and to an explicit characterization of the limiting variance in the central limit theorem of the algorithm. A complexity of the multilevel Monte Carlo algorithm is carried out.

math.PR↗

arXiv2006

Theorems Limit With Weight For The Vectorial Martingales To Continuous Time

We develop a general approach of the almost sure central limit theorem for the quasi-continuous vectorial martingales and we release a quadratic extension of this theorem while specifying speeds of convergence. As an application of this result we study the problem of estimate the variance of a process with stationary and idependent increments in statistics.

math.PR↗

arXiv2006

Statistical Romberg extrapolation: A new variance reduction method and applications to option pricing

We study the approximation of $\mathbb{E}f(X_T)$ by a Monte Carlo algorithm, where $X$ is the solution of a stochastic differential equation and $f$ is a given function. We introduce a new variance reduction method, which can be viewed as a statistical analogue of Romberg extrapolation method. Namely, we use two Euler schemes with steps $δ$ and $δ^β,0<β<1$. This leads to an algorithm which, for a given level of the statistical error, has a complexity significantly lower than the complexity of the standard Monte Carlo method. We analyze the asymptotic error of this algorithm in the context of general (possibly degenerate) diffusions. In order to find the optimal $β$ (which turns out to be $β=1/2$), we establish a central limit type theorem, based on a result of Jacod and Protter for the asymptotic distribution of the error in the Euler scheme. We test our method on various examples. In particular, we adapt it to Asian options. In this setting, we have a CLT and, as a by-product, an explicit expansion of the discretization error.

math.PR↗