Thinning to improve two-sample discrepancy

DOI10.1002/RSA.70049MaRDI QIDQ6857765zbMATH OpenFDO

Authors Gleb Smirnov, Roman Vershynin

Publication date 16 February 2026

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.70049

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10)

Cites work

• Discrepancy minimization via a self-balancing walk
• Geometric discrepancy. An illustrated guide
• Heuristic approaches to obtain low-discrepancy point sets via subset selection
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• scientific article; zbMATH DE number 4000052 (Why is no real title available?)
• scientific article; zbMATH DE number 7788507 (Why is no real title available?)
• Low-discrepancy point sets for non-uniform measures
• On-line balancing of random inputs
• Online vector balancing and geometric discrepancy
• Regularizing random points by deleting a few
• The power of online thinning in reducing discrepancy
• Tusnády's problem, the transference principle, and non-uniform QMC sampling

This page was built for publication: Thinning to improve two-sample discrepancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857765)