In this article, I discuss the need for Halton sequences and discuss the Mata implementation of scrambling of Halton sequences, providing several examples of scrambling procedures.
AtanassovE. I.2004. On the discrepancy of the Halton sequences. Mathematica Balkanica18: 15–32.
2.
BraatenE., and WellerG.1979. An improved low-discrepancy sequence for multi-dimensional quasi-Monte Carlo integration. Journal of Computational Physics33: 249–258.
3.
DrukkerD. M., and GatesR.2006. Generating Halton sequences using Mata. Stata Journal6: 214–228.
FaureH., and LemieuxC.2009. Generalized Halton sequences in 2008: A comparative study. ACM Transactions on Modeling and Computer Simulations19: 1–31.
6.
HaltonJ. H.1960. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numerische Mathematik2: 84–90.
7.
LemieuxC.2009. Monte Carlo and Quasi-Monte Carlo Sampling.New York: Springer.
8.
NiederreiterH.1992. Random Number Generation and Quasi-Monte Carlo Methods.Philadelphia: Society for Industrial and Applied Mathematics.
9.
RoodmanD.2011. Fitting fully observed recursive mixed-process models with cmp. Stata Journal11: 159–206.
10.
SchlierC.2008. On scrambled Halton sequences. Applied Numerical Mathematics58: 1467–1478.
11.
VandewoestyneB., and CoolsR.2006. Good permutations for deterministic scrambled Halton sequences in terms of L2-discrepancy. Journal of Computational and Applied Mathematics189: 341–361.
