Book contents
- Frontmatter
- Contents
- List of illustrations
- Preface
- 1 Option
- 2 Option valuation preliminaries
- 3 Random variables
- 4 Computer simulation
- 5 Asset price movement
- 6 Asset price model: Part I
- 7 Asset price model: Part II
- 8 Black–Scholes PDE and formulas
- 9 More on hedging
- 10 The Greeks
- 11 More on the Black–Scholes formulas
- 12 Risk neutrality
- 13 Solving a nonlinear equation
- 14 Implied volatility
- 15 Monte Carlo method
- 16 Binomial method
- 17 Cash-or-nothing options
- 18 American options
- 19 Exotic options
- 20 Historical volatility
- 21 Monte Carlo Part II: variance reduction by antithetic variates
- 22 Monte Carlo Part III: variance reduction by control variates
- 23 Finite difference methods
- 24 Finite difference methods for the Black–Scholes PDE
- References
- Index
4 - Computer simulation
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- List of illustrations
- Preface
- 1 Option
- 2 Option valuation preliminaries
- 3 Random variables
- 4 Computer simulation
- 5 Asset price movement
- 6 Asset price model: Part I
- 7 Asset price model: Part II
- 8 Black–Scholes PDE and formulas
- 9 More on hedging
- 10 The Greeks
- 11 More on the Black–Scholes formulas
- 12 Risk neutrality
- 13 Solving a nonlinear equation
- 14 Implied volatility
- 15 Monte Carlo method
- 16 Binomial method
- 17 Cash-or-nothing options
- 18 American options
- 19 Exotic options
- 20 Historical volatility
- 21 Monte Carlo Part II: variance reduction by antithetic variates
- 22 Monte Carlo Part III: variance reduction by control variates
- 23 Finite difference methods
- 24 Finite difference methods for the Black–Scholes PDE
- References
- Index
Summary
OUTLINE
random number generation
sample mean and variance
kernel density estimation
quantile–quantile plots
Motivation
The models that we develop for option valuation will involve randomness. One of the main thrusts of this book is the use of computer simulation to experiment with and visualize our ideas, and also to estimate quantities that cannot be determined analytically. This chapter introduces the tools that we will apply.
Pseudo-random numbers
Computers are deterministic – they do exactly what they are told and hence are completely predictable. This is generally a good thing, but it is at odds with the idea of generating random numbers. In practice, however, it is usually sufficient to work with pseudo-random numbers. These are collections of numbers that are produced by a deterministic algorithm and yet seem to be random in the sense that, en masse, they have appropriate statistical properties. Our approach here is to assume that we have access to black-box programs that generate large sequences of pseudo-random numbers. Hence, we completely ignore the fascinating issue of designing algorithms for generating pseudo-random numbers. Our justification for this omission is that random number generation is a highly advanced, active, research topic and it is unreasonable to expect non-experts to understand and implement programs that compete with the state-of-the-art. Off-the-shelf is better than roll-your-own in this context, and by making use of existing technology we can more quickly progress to the topics that are central to this book.
- Type
- Chapter
- Information
- An Introduction to Financial Option ValuationMathematics, Stochastics and Computation, pp. 33 - 44Publisher: Cambridge University PressPrint publication year: 2004