Modern Stochastics: Theory and Applications

The term moderate deviations is often used in the literature to mean a class of large deviation principles that, in some sense, fills the gap between a convergence in probability to zero (governed by a large deviation principle) and a weak convergence to a centered Normal distribution. The notion of noncentral moderate deviations is used when the weak convergence is towards a non-Gaussian distribution. In this paper, noncentral moderate deviation results are presented for two fractional Skellam processes known in the literature (see [20]). It is established that, for the fractional Skellam process of type 2 (for which one can refer to the recent results for compound fractional Poisson processes in [3]), the convergences to zero are usually faster because one can prove suitable inequalities between rate functions.

The chaos expansion of a random variable with uniform distribution is given. This decomposition is applied to analyze the behavior of each chaos component of the random variable $\log \zeta $ on the so-called critical line, where ζ is the Riemann zeta function. This analysis gives a better understanding of a famous theorem by Selberg.

In this paper we present a numerical scheme for stochastic differential equations based upon the Wiener chaos expansion. The approximation of a square integrable stochastic differential equation is obtained by cutting off the infinite chaos expansion in chaos order and in number of basis elements. We derive an explicit upper bound for the ${L^{2}}$ approximation error associated with our method. The proofs are based upon an application of Malliavin calculus.

This study introduces computation of option sensitivities (Greeks) using the Malliavin calculus under the assumption that the underlying asset and interest rate both evolve from a stochastic volatility model and a stochastic interest rate model, respectively. Therefore, it integrates the recent developments in the Malliavin calculus for the computation of Greeks: Delta, Vega, and Rho and it extends the method slightly. The main results show that Malliavin calculus allows a running Monte Carlo (MC) algorithm to present numerical implementations and to illustrate its effectiveness. The main advantage of this method is that once the algorithms are constructed, they can be used for numerous types of option, even if their payoff functions are not differentiable.

We study the weak limits of solutions to SDEs where the sequence $\{a_{n}\}$ converges in some sense to $(c_{-}\mathbb{1}_{x<0}+c_{+}\mathbb{1}_{x>0})/x+\gamma \delta _{0}$. Here $\delta _{0}$ is the Dirac delta function concentrated at zero. A limit of $\{X_{n}\}$ may be a Bessel process, a skew Bessel process, or a mixture of Bessel processes.