The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Uniform Central Limit Theorems
Abstract
In this new edition of a classic work on empirical processes the author, an acknowledged expert, gives a thorough treatment of the subject with the addition of several proved theorems not included in the first edition, including the Bretagnolle–Massart theorem giving constants in the Komlos–Major–Tusnady rate of convergence for the classical empirical process, Massart's form of the Dvoretzky–Kiefer–Wolfowitz inequality with precise constant, Talagrand's generic chaining approach to boundedness of Gaussian processes, a characterization of uniform Glivenko–Cantelli classes of functions, Giné and Zinn's characterization of uniform Donsker classes, and the Bousquet–Koltchinskii–Panchenko theorem that the convex hull of a uniform Donsker class is uniform Donsker. The book will be an essential reference for mathematicians working in infinite-dimensional central limit theorems, mathematical statisticians, and computer scientists working in computer learning theory. Problems are included at the end of each chapter so the book can also be used as an advanced text.
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
Cites
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Cited by
Lattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Potdevin, D., Clavel, C., & Sabouret, N. (2021) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2021.102612 · Cited by 28
Metadata
- Authors
- Dudley, R. M.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2014-02-24
- OpenAlex
- W3004800139
- Cited by
- 166
- References
- 1
- FWCI
- 1.48
- Type
- book
- 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: Uniform Central Limit Theorems. https://app.cochat.ai/papers/10.1017/cbo9781139014830
- The paper
- Dudley, R. M. (2014). Uniform Central Limit Theorems. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139014830
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.