Combinatorics of random processes and sections of convex bodies

@inproceedings{Rudelson2005CombinatoricsOR,
  title={Combinatorics of random processes and sections of convex bodies},
  author={Mark Rudelson and Roman Vershynin},
  year={2005}
}
We find a sharp combinatorial bound for the metric entropy of sets in R and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central Limit Theorem if the square root of its combinatorial dimension is integrable. 2. The uniform entropy is equivalent to the combinatorial dimension under minimal regularity. Our method also constructs a nicely bounded coordinate section of a symmetric convex body… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Vapnik-Chervonenkis type conditions and uniform Donsker classes of functions

  • M. Talagrand
  • Ann. Prob
  • 2003

The Glivenko-Cantelli problem, ten years

  • M. Talagrand
  • later, J. Theoret. Probab
  • 1996

Type, infratype, and Elton-Pajor Theorem

  • M. Talagrand
  • Inventiones Math
  • 1992

Similar Papers

Loading similar papers…