Central Limit Theorem for $(t,s)$-sequences, I
Mordechay B. Levin

TL;DR
This paper establishes a central limit theorem for the local discrepancy of digital $(t,s)$-sequences, showing that normalized discrepancy measures converge in distribution to a Gaussian as the sequence length increases.
Contribution
It proves the weak convergence of the normalized local discrepancy to a Gaussian distribution and characterizes the asymptotic behavior of discrepancy moments for digital $(t,s)$-sequences.
Findings
Normalized discrepancy converges to Gaussian distribution.
Discrepancy moments stabilize to a constant involving the Gaussian integral.
Results hold for sequences as length tends to infinity.
Abstract
Let be a digital -sequence in base , , and let be the local discrepancy of . Let be the digital addition of and , and let In this paper, we prove that weakly converge to the standard Gaussisian distribution for , where are uniformly distributed random variables in . In addition, we prove that \begin{equation} \nonumber \mathcal{M}_{s,p} (\mathcal{P}_m) / \mathcal{M}_{s,2} (\mathcal{P}_m) \to \frac{1}{\sqrt{2\pi}}\int_{-\infty}^{\infty} |u|^p e^{-u^2/2} \mathrm{d}u \quad {\rm for} \; \; m \to \infty , \;\; p>0. \end{equation}
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Analytic Number Theory Research · Cryptography and Residue Arithmetic
