Abstract
The Soboĺ sequence is the most popular quasirandom sequence because of its simplicity and efficiency in implementation. We summarize aspects of the scrambling technique applied to Soboĺ sequences and propose a new simpler modified scrambling algorithm, called the multi-digit scrambling scheme. Most proposed scrambling methods randomize a single digit at each iteration. In contrast, our multi-digit scrambling scheme randomizes one point at each iteration, and therefore is more efficient. After the scrambled Soboĺ sequence is produced, we use this sequence to evaluate a particular derivative security, and found that when this sequence is numerically tested, it is shown empirically to be far superior to the original unscrambled sequence.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Atanassov, E.: A new efficient algorithm for generating the scrambled soboĺ sequence. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 83–90. Springer, Heidelberg (2003)
Black, F., Scholes, M.: The pricing of options and corporate liabilities. Journal of Political Economy 81, 637–659 (1973)
Boyle, P.: New life forms on the option landscape. Journal of Financial Engineering 2(3), 217–252 (1992)
Bratley, P., Fox, B.: Algorithm 659: Implementing soboĺ’s quasirandom sequnence generator. ACM Trans. on Mathematical Software 14(1), 88–100 (1988)
Cheng, J., Druzdzel, M.J.: Computational investigation of low-discrepancy sequences in simulation algorithms for bayesian networks. In: Uncertainty in Artificial Intelligence: Proceedings of the Sixteenth Conference (UAI 2000), pp. 72–81. Morgan Kaufmann Publishers, San Francisco (2000)
Chi, H., Mascagni, M., Warnock, T.: On the optimal Halton sequences. Mathematics and Computers in Simulation (2005) (to appear)
Fishman, G.A., Moore, L.R.: An exhaustive analysis of multiplicative congruential random number generators with modulus 231− 1. SIAM J. Sci. Stat. Comput. 7, 24–45 (1986)
Hong, H.S., Hickernell, F.J.: Algorithm 823: Implementing scrambled digital sequences. ACM Transactions on Mathematical Software 29(2), 95–109 (2003)
Hull, J.: Options, Future and Other Derivative Secutrities. Prentice-Hall, New York (2000)
Jackel, P.: Monte Carlo Methods in Finance. John Wiley and Sons, New York (2002)
Joe, S., Kuo, F.Y.: Remark on Algorithm 659: Implementing Soboĺ’s quasirandom sequence generator. ACM Transactions on Mathematical Software 29(1), 49–57 (2003)
Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1997)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1994)
Mascagni, M.: Parallel linear congruential generators with prime moduli. Parallel Computing 24, 923–936 (1998)
Mascagni, M., Chi, H.: Parallel linear congruential generators with Sophie-Germain moduli. Parallel Computing 30, 1217–1231 (2004)
Matousek, J.: On the l2-discrepancy for anchored boxes. Journal of Complexity 14, 527–556 (1998)
Moro, B.: The full monte. Risk 8(2), 57–58 (1995)
Morokoff, W.J., Caflish, R.E.: Quasirandom sequences and their discrepancy. SIAM Journal on Scientific Computing 15, 1251–1279 (1994)
Owen, A.B.: Randomly permuted(t,m,s)-netsand (t,s)-sequences. In: Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics, vol. 106, pp. 299–317 (1995)
Paskov, S.H., Traub, J.F.: Faster valuation of financial derivatives. J. Portfolio Management 22(1), 113–120 (Fall 1995)
Soboĺ, I.M.: On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. and Math. Phy. 7(4), 86–112 (1967)
Soboĺ, I.M.: Uniformly distributed sequences with additional uniformity properties. USSR Comput. Math. and Math. Phy. 16, 236–242 (1976)
Tezuka, S.: Uniform Random Numbers, Theory and Practice. Kluwer Academic Publishers, IBM Japan (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chi, H., Beerli, P., Evans, D.W., Mascagni, M. (2005). On the Scrambled Soboĺ Sequence. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428862_105
Download citation
DOI: https://doi.org/10.1007/11428862_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26044-8
Online ISBN: 978-3-540-32118-7
eBook Packages: Computer ScienceComputer Science (R0)