Generating Quasi-Random Paths for Stochastic Processes
The paper addresses the question of how to use quasi-Monte Carlo methods to improve the simulation of stochastic processes numerically. Two general procedures, viz. the generalized Brownian bridge and the particle reordering, have been developed for generating discrete sample paths associated with a stochastic process using quasi-random sequences. The main conclusions show that even for nominally high-dimensional integration problems arising from discrete stochastic methods, quasi-Monte Carlo methods can improve the computation time ranging from a factor of three (when the Brownian bridge discretization is used in conjunction with the quadratic term of a Taylor series as a control variate) to a factor of ten (comparing the Brownian bridge approach with antithetic random Monte Carlo). The best method and the degree of success depends on the nature of the integrand. The two techniques are applied to a problem from finance, viz. the valuation of a 30-year bond with monthly coupon payments assuming a mean reverting stochastic interest rate. When expressed as an integral, this problem is nominally 360 dimensional. The analysis of the integrand explains the effectiveness of the quasi-random sequences on this high-dimensional problem and suggests methods of variance reduction which can be used in conjunction with the quasi-random sequences.
- Optimal prediction for Hamiltonian partial differential equations
- Quadrature formulas for the Wiener measure
- The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
- The effective dimension and quasi-Monte Carlo integration
- Quasi-Monte Carlo method in population genetics parameter estimation
- Valuing convertible bonds based on LSRQM method
- Quasi-random numbers for copula models
- Space-time adaptive finite difference method for European multi-asset options
- New Brownian bridge construction in quasi-Monte Carlo methods for computational finance
- Probabilistically induced domain decomposition methods for elliptic boundary-value problems
- Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
- How do path generation methods affect the accuracy of quasi-Monte Carlo methods for problems in finance?
- Quasi-Monte Carlo simulation of random walks in finance
- The AEP algorithm for the fast computation of the distribution of the sum of dependent random variables
- Brownian path generation and polynomial chaos
- An algorithm for probabilistic solution of parabolic PDEs
- On the tractability of the Brownian bridge algorithm
- Quasi-Monte Carlo methods with applications in finance
This page was built for publication: Generating Quasi-Random Paths for Stochastic Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229428)