Modern Stochastics: Theory and Applications

The existence of density function of the running maximum of a stochastic differential equation (SDE) driven by a Brownian motion and a nontruncated pure-jump process is verified. This is proved by the existence of density function of the running maximum of the Wiener–Poisson functionals resulting from Bismut’s approach to the Malliavin calculus for jump processes.

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 establish the existence and the uniqueness of the solution of a special class of BSDEs for Lévy processes in the case of a Lipschitz generator of sublinear growth. We then study a related problem of logarithmic utility maximization of the terminal wealth in the filtration generated by an arbitrary Lévy process.

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.