The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
On Tail Probabilities for Martingales
Open accessAbstract
Watch a martingale with uniformly bounded increments until it first crosses the horizontal line of height $a$. The sum of the conditional variances of the increments given the past, up to the crossing, is an intrinsic measure of the crossing time. Simple and fairly sharp upper and lower bounds are given for the Laplace transform of this crossing time, which show that the distribution is virtually the same as that for the crossing time of Brownian motion, even in the tail. The argument can be adapted to extend inequalities of Bernstein and Kolmogorov to the dependent case, proving the law of the iterated logarithm for martingales. The argument can also be adapted to prove Levy's central limit theorem for martingales. The results can be extended to martingales whose increments satisfy a growth condition.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
An Introduction to Probability Theory.
Fristedt, B., & Moran, P. A. P. (1986) · Journal of the American Statistical Association · doi:10.2307/2288022 · Cited by 3,300
Probability Inequalities for the Sum of Independent Random Variables
Bennett, G. (1962) · Journal of the American Statistical Association · doi:10.1080/01621459.1962.10482149 · Cited by 782
Serfling, R. J. (1973) · Technometrics · doi:10.1080/00401706.1973.10489100 · Cited by 297
Almost sure behavior of sums of independent random variables and martingales
Strassen, V. (1967) · Project Euclid (Cornell University) · Cited by 294
A Sharper Form of the Borel-Cantelli Lemma and the Strong Law
Dubins, L. E., & Freedman, D. A. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700054 · Cited by 98
Self-citation
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
Srinivas, N., Krause, A., Kakade, S. M., & Seeger, M. W. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2182033 · Cited by 1,850
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 718
(2008) · ScholarlyCommons (University of Pennsylvania) · Cited by 581
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 569
McDiarmid, C. (1998) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12788-9_6 · Cited by 405
The chromatic number of random graphs
Bollobás, B. (1988) · Combinatorica · doi:10.1007/bf02122551 · Cited by 360
Radner, R., & Rothschild, M. (1975) · Journal of Economic Theory · doi:10.1016/0022-0531(75)90006-x · Cited by 301
Time-uniform, nonparametric, nonasymptotic confidence sequences
Howard, S. R., Ramdas, A., McAuliffe, J., & Sekhon, J. (2021) · The Annals of Statistics · doi:10.1214/20-aos1991 · Cited by 190
Minimax Regret Bounds for Reinforcement Learning
Azar, M. G., Osband, I., & Munos, R. (2017) · arXiv · doi:10.48550/arxiv.1703.05449 · Cited by 124
Metadata
- Authors
- Freedman, D. A.
- Venue
- The Annals of Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 1975-02-01
- Volume
- 3
- Issue
- 1
- ISSN
- 0091-1798 (ISSN-L)
- OpenAlex
- W2083459869
- Cited by
- 618
- References
- 7
- FWCI
- 4.72
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.