Multilevel Monte Carlo methods for applications in finance

Since Giles introduced the multilevel Monte Carlo path simulation method [18], there has been rapid development of the technique for a variety of applications in computational finance. This paper surveys the progress so far, highlights the key features in achieving a high rate of multilevel variance convergence, and suggests directions for future research.Comment: arXiv admin note: text overlap with arXiv:1202.6283; and with arXiv:1106.4730 by other author

Consistency of Markov chain quasi-Monte Carlo on continuous state spaces

The random numbers driving Markov chain Monte Carlo (MCMC) simulation are usually modeled as independent U(0,1) random variables. Tribble [Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (2007) Stanford Univ.] reports substantial improvements when those random numbers are replaced by carefully balanced inputs from completely uniformly distributed sequences. The previous theoretical justification for using anything other than i.i.d. U(0,1) points shows consistency for estimated means, but only applies for discrete stationary distributions. We extend those results to some MCMC algorithms for continuous stationary distributions. The main motivation is the search for quasi-Monte Carlo versions of MCMC. As a side benefit, the results also establish consistency for the usual method of using pseudo-random numbers in place of random ones.Comment: Published in at http://dx.doi.org/10.1214/10-AOS831 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

Computing Greeks using multilevel path simulation

We investigate the extension of the multilevel Monte Carlo method [2, 3] to the calculation of Greeks. The pathwise sensitivity analysis [5] differentiates the path evolution and effectively reduces the smoothness of the payoff. This leads to new challenges: the use of naive algorithms is often impossible because of the inapplicability of pathwise sensitivities to discontinuous payoffs.\ud \ud These challenges can be addressed in three different ways: payoff smoothing using conditional expectations of the payoff before maturity [5]; an approximation of the above technique using path splitting for the final timestep [1]; the use of a hybrid combination of pathwise sensitivity and the Likelihood Ratio Method [4]. We discuss the strengths and weaknesses of these alternatives in different multilevel Monte Carlo settings

A two factor long memory stochastic volatility model

In this paper we fit the main features of financial returns by means of a two factor long memory stochastic volatility model (2FLMSV). Volatility, which is not observable, is explained by both a short-run and a long-run factor. The first factor follows a stationary AR(1) process whereas the second one, whose purpose is to fit the persistence of volatility observable in data, is a fractional integrated process as proposed by Breidt et al. (1998) and Harvey (1998). We show formally that this model (1) creates more kurtosis than the long memory stochastic volatility (LMSV) of Breidt et al. (1998) and Harvey (1998), (2) deals with volatility persistence and (3) produces small first order autocorrelations of squared observations. In the empirical analysis, we use the estimation procedure of Gallant and Tauchen (1996), the Efficient Method of Moments (EMM), and we provide evidence that our specification performs better than the LMSV model in capturing the empirical facts of data