Another Random Scrambling of Digital (t,s)-Sequences
This paper presents a new random scrambling of digital (t,s)-sequences and its application to two problems from finance, showing the usefulness of this new class of randomized low-discrepancy sequences; moreover the simplicity of the construction allows efficient implementation and should facilitate the derandomization in this particular class; also the search of the effective dimension in high dimensional applications should be improved by the use of such scramblings.
Unable to display preview. Download preview PDF.
- 4.H. Faure, Variations on (0,s)-sequences, Journal of Complexity, to appear.Google Scholar
- 7.J. Matousek, Geometric Discrepancy: An Illustrated Guide, Springer, 1999.Google Scholar
- 9.H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics 63, SIAM, 1992.Google Scholar
- 10.H. Niederreiter and C.P. Xing, Nets, (t,s)-sequences and Algebraic Geometry, in Lecture Notes in Statistics 138 (P. Hellekalek and G.% Larcher, Ed.) Springer (1998), 267–302.Google Scholar
- 11.A. Owen, Randomly Permuted (t,m,s)-nets and (t,s)-sequences, in Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P. Shiue, Ed.) Springer-Verlag (1995), 299–317.Google Scholar
- 12.S. Tezuka, Polynomial Arithmetic Analogue of Halton Sequences, ACM Tomacs 3-2 (1993), 99-107.Google Scholar
- 13.S. Tezuka, A Generalization of Faure Sequences and its Efficient Implementation, Research Report IBM RT0105 (1994), 1–10.Google Scholar
- 15.S. Tezuka, Quasi-Monte Carlo — Discrepancy between Theory and Practice, mcqmc2000, Springer-Verlag, in this volume.Google Scholar