The DOI matches its Crossref record.
A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
Abstract
How many independent samplesNdo we need from a distributionpto decide thatpis epsiv-distant from uniform in an L1sense, Sigmai=1m|p(i) - 1/m| > epsiv? (Heremis the number of bins on which the distribution is supported, and is assumed knownapriori.) Somewhat surprisingly, we only needNepsiv2Gtm1/2to make this decision reliably (this condition is both sufficient and necessary). The test for uniformity introduced here is based on the number of observed ldquocoincidencesrdquo (samples that fall into the same bin), the mean and variance of which may be computed explicitly for the uniform distribution and bounded nonparametrically for any distribution that is known to be epsiv-distant from uniform. Some connections to the classical birthday problem are noted.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
Inference under information constraints I: Lower bounds from chi-square contraction
Acharya, J., Canonne, C. L., & Tyagi, H. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3028440 · Cited by 59
“Then, the sample complexity of ( k, ε/ 3) -distribution testing must be at least When P is set to be Paninski’s perturbed family given in Eq.”
BackgroundMethodInfluential
Metadata
- Authors
- Paninski, L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-10
- Volume
- 54
- Issue
- 10
- Pages
- 4750-4755
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2104648144
- Cited by
- 208
- References
- 0
- FWCI
- 2.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data. https://app.cochat.ai/papers/10.1109/tit.2008.928987
- The paper
- Paninski, L. (2008). A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.928987
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.