On the Tchebychef Inequality of Bernstein

DOI10.1214/AOMS/1177732803zbMATH Open0007.02303OpenAlexW2034711706WikidataQ100653066 ScholiaQ100653066MaRDI QIDQ4752887FDOQ4752887

Authors: Cecil C. Craig 

Publication date: 1933

Published in: Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177732803

zbMATH Keywords

probability theory, operations research

Cited In (10)

• Transversals in trees
• The generalization performance of ERM algorithm with strongly mixing observations
• Title not available (Why is that?)
• Nonparametric estimation of low rank matrix valued function
• Time-uniform Chernoff bounds via nonnegative supermartingales
• Random trees have height \(O(\sqrt{n})\)
• On Sub-Gaussian Concentration of Missing Mass
• Density-sensitive semisupervised inference
• In praise (and search) of J. V. Uspensky
• Majority bootstrap percolation on \(G(n,p)\)

This page was built for publication: On the Tchebychef Inequality of Bernstein

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