Art B. Owen
Skip Abstract Section
Abstract
There have been many proposals for randomizations of digital nets. Some of those proposals greatly reduce the computational burden of random scrambling. This article compares the sampling variance under different scrambling methods. Some scrambling methods adversely affect the variance, even to the extent of deteriorating the rate at which variance converges to zero. Surprisingly, a new scramble proposed here, has the effect of improving the rate at which the variance converges to zero, but so far, only for one dimensional integrands. The mean squared L2 discrepancy is commonly used to study scrambling schemes. In this case, it does not distinguish among some scrambles with different convergence rates for the variance.
- Bakhvalov, N. S. 1959. On approximate calculation of multiple integrals. Vestnik Moskovskogo Universiteta, Seriya Matematiki, Mehaniki, Astronomi, Fiziki, Himii 4, 3--18. (In Russian).Google Scholar
- Cochran, W. G. 1977. Sampling Techniques (3rd Ed). Wiley, New York.Google Scholar
- Cranley, R. and Patterson, T. 1976. Randomization of number theoretic methods for multiple integration. SIAM J. Numer. Anal. 13, 904--914.Google ScholarDigital Library
- de Boor, C. 1978. A Practical Guide to Splines. Springer, New York.Google Scholar
- Faure, H. 1982. Discrépance de suites associées à un systéme de numération (en dimension s). Acta Arithmet. 41, 337--351.Google ScholarCross Ref
- Faure, H. 1992. Good permutations for extreme discrepancy. J. Numb. Theory 42, 47--56.Google ScholarCross Ref
- Faure, H. 2001. Variations on (0,s)-sequences. J. Complex. 17, 741--753.Google ScholarDigital Library
- Faure, H. and Tezuka, S. 2002. Another random scrambling of digital (t,s)--sequences. In Monte Carlo and Quasi-Monte Carlo Methods 2000, K. T. Fang, F. J. Hickernell, and H. Niederreiter, Eds. Springer-Verlag, Berlin, Germany, 242--256.Google Scholar
- Fox, B. L. 1999. Strategies for quasi-Monte Carlo. Kluwer Academic, Boston, Mass.Google Scholar
- Friedel, I. and Keller, A. 2002. Fast generation of randomized low-discrepancy point sets. In Monte Carlo and Quasi-Monte Carlo Methods 2000, K. T. Fang, F. J. Hickernell, and H. Niederreiter, Eds. Springer-Verlag, Berlin, Germany, 257--273.Google Scholar
- Haber, S. 1967. A modified Monte Carlo quadrature, II. Math. Computat. 21, 388--397.Google ScholarCross Ref
- Heinrich, S. 1993. Random approximation in numerical analysis. In Functional analysis. Proceedings of the Essen Conference (Essen, Germany, Nov. 24--30). K. D. Bierstedt, A. Pietsch, W. M. Ruess, and D. Vogt, Eds. Marcel Dekker, New York, 123--171.Google Scholar
- Hickernell, F. J. 1996a. The mean square discrepancy of randomized nets. ACM Trans. Model. Comput. Simul. 6, 274--296. Google ScholarDigital Library
- Hickernell, F. J. 1996b. Quadrature error bounds and figures of merit for quasi-random points. SIAM J. Numer. Anal. 33, 1995--2016. Corrected printing of Sections 3-6 in ibid., 34 (1997), 853--866. Google ScholarDigital Library
- Hickernell, F. J. 1998a. A generalized discrepancy and quadrature error bound. Math. Comput. 67, 299--322. Google ScholarDigital Library
- Hickernell, F. J. 1998b. Lattice rules: how well do they measure up? In Random and Quasi-Random Point Sets, P. Hellekalek and G. Larcher, Eds. Springer, New York, 109--168.Google Scholar
- Hickernell, F. J. and Yue, R. X. 2000. The mean square discrepancy of scrambled (t,s)-sequences. SIAM J. Numer. Anal. 38, 1089--1112. Google ScholarDigital Library
- Hlawka, E. 1961. Funktionen von beschränkter Variation in der Theorie der Gleichverteilung. Ann. Mate. Pura Appl. 54, 325--333.Google ScholarCross Ref
- Hong, H. S. and Hickernell, F. J. 1999. The asymptotic efficiency of randomized nets for quadrature. Math. Comput. 68, 767--791. Google ScholarDigital Library
- Hong, H. S. and Hickernell, F. J. 2003. Implementing scrambled digital sequences. AMS Trans. Math/Softw. 29, 95--109. Google ScholarDigital Library
- L'Ecuyer, P. and Lemieux, C. 2002. A survey of randomized quasi-Monte Carlo methods. In Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications, M. Dror, P. L'Ecuyer, and F. Szidarovszki, Eds. Kluwer Academic Publishers, New York, 419--474.Google Scholar
- Matoušek, J. 1998a. Geometric Discrepancy : An Illustrated Guide. Springer-Verlag, Heidelberg.Google Scholar
- Matoušek, J. 1998b. On the L2--discrepancy for anchored boxes. J. Complex. 14, 527--556. Google ScholarDigital Library
- Niederreiter, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, PA. Google ScholarDigital Library
- Owen, A. B. 1995. 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. J.-S. Shiue, Eds. Springer-Verlag, New York, 299--317.Google Scholar
- Owen, A. B. 1997a. Monte Carlo variance of scrambled equidistribution quadrature. SIAM J. Numer. Anal. 34, 5, 1884--1910. Google ScholarDigital Library
- Owen, A. B. 1997b. Scrambled net variance for integrals of smooth functions. Ann. Stat. 25, 4, 1541--1562.Google ScholarCross Ref
- Owen, A. B. 1998. Latin supercube sampling for very high dimensional simulations. ACM Trans. Model. Comput. Simul. 8, 2, 71--102. Google ScholarDigital Library
- Owen, A. B. 1999. Monte Carlo, quasi-Monte Carlo, and randomized quasi-Monte Carlo. In Monte Carlo and quasi-Monte Carlo Methods 1998, H. Niederreiter and J. Spanier, Eds. Springer-Verlag, Berlin, 86--97.Google Scholar
- Roth, K. F. 1980. On irregularities of distribution IV. Acta Arithmet. 37, 67--75.Google ScholarCross Ref
- Tan, K. S. and Boyle, P. P. 2000. Applications of randomized low discrepancy sequences to the valuation of complex securities. J. Econ. Dynam. Cont. 24, 1747--1782.Google ScholarCross Ref
- Tezuka, S. 1995. Uniform random numbers: theory and practice. Kluwer Academic Publishers, Boston, Mass.Google Scholar
- Tezuka, S. 2002. On randomization of generalized faure sequences. Tech. Rep. RT0494, IBM Tokyo Research Laboratory.Google Scholar
- Tezuka, S. and Faure, H. 2002. I-binomial scrambling of digital nets and sequences. Tech. Rep., IBM Tokyo Research Laboratory.Google Scholar
- van der Corput, J. G. 1935a. Verteilungsfunktionen I. Nederl. Akad. Wetensch. Proc. 38, 813--821.Google Scholar
- van der Corput, J. G. 1935b. Verteilungsfunktionen II. Nederl. Akad. Wetensch. Proc. 38, 1058--1066.Google Scholar
- Zaremba, S. K. 1968. Some applications of multidimensional integration by parts. Ann. Pol. Math. 21, 85--96.Google ScholarCross Ref
Index Terms
- Variance with alternative scramblings of digital nets
Recommendations
Monte Carlo Variance of Scrambled Net Quadrature
Hybrids of equidistribution and Monte Carlo methods of integration can achieve the superior accuracy of the former while allowing the simple error estimation methods of the latter. This paper studies the variance of one such hybrid, scrambled nets, by ...
New approach in steganography by integrating different LSB algorithms and applying randomization concept to enhance security
ICCCS '11: Proceedings of the 2011 International Conference on Communication, Computing & SecurityIn this paper we propose a new technique in steganography to hide the information to be hidden with digital image. Here we take BMP image to hide the data. We take most common Steganography algorithm LSB as base and made some changes in it based upon ...
Watermarking via optimization algorithms for quantizing randomized semi-global image statistics
We introduce a novel approach for blind and semi-blind watermarking and apply it to images. We derive randomized robust semi-global statistics of images in a suitable transform domain (wavelets in case of images) and quantize them in order to embed the ...
Comments