Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T15:03:20.992Z Has data issue: false hasContentIssue false

Rates of convergence for random approximations of convex sets

Published online by Cambridge University Press:  01 July 2016

Lutz Dümbgen*
Affiliation:
Universität Heidelberg
Günther Walther*
Affiliation:
Stanford University
*
∗ Postal address: Institut für Angewandte Mathematik, Universität Heidelberg, Im Neuenheimer Feld 294, D-69120 Heidelberg, Germany. E-mail: lutz@statlab.uni-heidelberg.de
∗∗ Postal address: Department of Statistics, Stanford University, Stanford CA 94305, USA. e-mail: walther@playfair.stanford.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The Hausdorff distance between a compact convex set K ⊂ ℝd and random sets is studied. Basic inequalities are derived for the case of being a convex subset of K. If applied to special sequences of such random sets, these inequalities yield rates of almost sure convergence. With the help of duality considerations these results are extended to the case of being the intersection of a random family of halfspaces containing K.

Information

Type
Stochastic Geometry and Statistical Applications
Copyright
Copyright © Applied Probability Trust 1996