Multiplicative noise, fast convolution, and pricing

Giacomo Bormetti and Sofia Cazzaniga

Papers from arXiv.org

Abstract: In this work we detail the application of a fast convolution algorithm computing high dimensional integrals to the context of multiplicative noise stochastic processes. The algorithm provides a numerical solution to the problem of characterizing conditional probability density functions at arbitrary time, and we applied it successfully to quadratic and piecewise linear diffusion processes. The ability in reproducing statistical features of financial return time series, such as thickness of the tails and scaling properties, makes this processes appealing for option pricing. Since exact analytical results are missing, we exploit the fast convolution as a numerical method alternative to the Monte Carlo simulation both in objective and risk neutral settings. In numerical sections we document how fast convolution outperforms Monte Carlo both in velocity and efficiency terms.

Date: 2011-07
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Quantitative Finance, 2012, 1-14 iFirst

Downloads: (external link)
http://arxiv.org/pdf/1107.1451 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1107.1451

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().