Hankel random digital nets simplify randomization in quasi-Monte Carlo by using structured random matrices, achieving standard convergence rates with median-of-means and greedy estimators.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quasi-Monte Carlo with a Hankel random digital net
Hankel random digital nets simplify randomization in quasi-Monte Carlo by using structured random matrices, achieving standard convergence rates with median-of-means and greedy estimators.