2016/05/13 by Michael Burr, Burr, Michael, Robert Fabrizio +1
Computer Science · Engineering · Mathematics · #52A22 #52C35 #60D05 #60F15 #Advanced Statistical Methods and Models #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #Image and Object Detection Techniques #Industrial Vision Systems and Defect Detection #Probability (math.PR) #Statistics Theory (math.ST)
paper · pdf · doi:10.48550/arxiv.1605.04323
openalex publication_date 2016/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Data depth functions are a generalization of one-dimensional order statistics and medians to real spaces of dimension greater than one; in particular, a data depth function quantifies the centrality of a point with respect to a data set or a probability distribution. One of the most commonly studied data depth functions is halfspace depth. It is of interest to computational geometers because it is highly geometric, and it is of interest to statisticians because it shares many desirable theoretical properties with the one-dimensional median. As the sample size increases, the halfspace depth for a sample converges to the halfspace depth for the underlying distribution, almost surely. In this paper, we use the geometry of halfspace depth to improve the explicit bounds on the rate of convergence.