CONTENTS

Exercise: Why Halton fails in high dimensions — projection pathology

The Halton sequence uses prime bases: p1=2,p2=3,p3=5,p_1 = 2, p_2 = 3, p_3 = 5, \ldots The jj-th coordinate of point nn is ϕpj(n)\phi_{p_j}(n), the radical inverse of nn in base pjp_j.

High-dimensional Halton is known to have correlated projections: for large primes pj,pkp_j, p_k, plotting the (pj,pk)(p_j, p_k)-projection of the first NN points shows systematic line patterns.

Tasks

  1. Generate the first N=1000N = 1000 points of the 30-dimensional Halton sequence. Plot the 2D projections (x(1),x(2))(x^{(1)}, x^{(2)}) (dimensions 1 and 2, bases 2,32, 3) and (x(29),x(30))(x^{(29)}, x^{(30)}) (dimensions 29 and 30, bases 113,127113, 127).

  2. Describe the visual pattern in each projection. Why are the two so different?

  3. Compute the 2-dimensional star-discrepancy of each projection numerically using a Monte Carlo approximation (sample many test boxes, take the max deviation). Compare.

  4. Explain the mathematical reason: for consecutive integers nn and n+1n+1, ϕp(n+1)ϕp(n)1/p\phi_{p}(n+1) - \phi_{p}(n) \approx 1/p (modulo "carry" effects), so when pj,pkp_j, p_k are both large, consecutive Halton points are close in both coordinates, tracing parallel lines.

  5. Leaped Halton — one fix — takes every \ell-th point for well-chosen \ell. Explain how leaping disrupts the projection pathology and why Sobol sequences avoid the problem structurally.

Hint

For the simulation, implement phi_p(n, p) by writing nn in base pp and reversing digits after the radix point.