Summary
Digital (0, s)-sequences in an arbitrary prime base b ≥ s may be randomly scrambled in various ways. Simple and widely used scramblings are obtained by multiplying on the left the upper triangular generator matrices by nonsingular lower triangular (NLT) matrices whose entries are randomly chosen in the set of digits Zb={0, 1, …, b − 1 [Tez94]. From our recent results [Fau05], we are able to propose subsets of Zb of various sizes for the random selection of the entries of the NLT matrices above. Moreover, since multiplications are permutations, our selection criteria are part of the general framework of Owen [Owe95] and may be applied to any kind of digital sequences, like Halton or Niederreiter sequences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Braaten, E., Weller, G.: An improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integration. J. Comput. Phys., 33, 249–258 (1979).
Chaix, H., Faure, H.: Discrépance et diaphonie en dimension un. Acta Arith., 63, 103–141 (1993).
Faure, H.: Discrépance de suites associées à un système de numération (en dimension un). Bull. Soc. Math. France, 109, 143–182 (1981).
Faure, H.: Discrépance de suites associées à un système de numération (en dimension s). Acta Arith., 41, 337–351 (1982).
Faure, H.: Good permutations for extreme discrepancy. J. Number Theory, 41, 47–56 (1992).
Faure, H.: Discrepancy and diaphony of digital (0,1)-sequences in prime base. Acta Arith. (to appear).
Faure, H., Tezuka, S.: Another random scrambling of digital (t, s)-sequences. In: Fang, K.T., Hickernell, F.J., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000. Springer, Berlin Heidelberg New York (2002).
Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Wiley, New York (1974).
Matoušek, J.: Geometric Discrepancy: An Illustrated Guide. Springer, Berlin Heidelberg New York (1999).
Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia (1992).
Owen, A.B.: Randomly permuted (t, m, s)-nets and (t, s)-sequences. In: Niederreiter, H., Shiue, P. (eds.) Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Springer, Berlin Heidelberg New York (1995).
Tezuka, S.: A generalization of Faure sequences and its efficient implementation. Research Report IBM RT0105 (1994).
Tezuka, S.: Uniform Random Numbers: Theory and Practice. Kluwer Academic Publishers, Boston (1995).
Tezuka, S., Faure, H.: I-binomial scrambling of digital nets and sequences. J. Complexity, 19, 744–757 (2003).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Faure, H. (2006). Selection Criteria for (Random) Generation of Digital (0,s)-Sequences. In: Niederreiter, H., Talay, D. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31186-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-31186-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25541-3
Online ISBN: 978-3-540-31186-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)