English
Related papers

Related papers: Tukey Depth Histograms

200 papers

We study families of depth measures defined by natural sets of axioms. We show that any such depth measure is a constant factor approximation of Tukey depth. We further investigate the dimensions of depth regions, showing that the Cascade…

Combinatorics · Mathematics 2022-08-11 Patrick Schnider

We formalize the notion of sampling a function using k-d darts. A k-d dart is a set of independent, mutually orthogonal, k-dimensional subspaces called k-d flats. Each dart has d choose k flats, aligned with the coordinate axes for…

The concept of statistical depth extends the notions of the median and quantiles to other statistical models. These procedures aim to formalize the idea of identifying deeply embedded fits to a model that are less influenced by…

Statistics Theory · Mathematics 2026-05-11 Jorge G. Adrover , Marcelo Ruiz

Data depth is a powerful nonparametric tool originally proposed to rank multivariate data from center outward. In this context, one of the most archetypical depth notions is Tukey's halfspace depth. In the last few decades notions of depth…

Methodology · Statistics 2024-05-27 Hyemin Yeon , Xiongtao Dai , Sara Lopez-Pintado

The halfspace depth is a well studied tool of nonparametric statistics in multivariate spaces, naturally inducing a multivariate generalisation of quantiles. The halfspace depth of a point with respect to a measure is defined as the infimum…

Methodology · Statistics 2024-09-30 Dušan Pokorný , Petra Laketa , Stanislav Nagy

Is there a natural way to order data in dimension greater than one? The approach based on the notion of data depth, often associated with John Tukey, is among the most popular. Tukey's depth has found applications in robust statistics,…

Statistics Theory · Mathematics 2026-01-13 Stanislav Minsker , Yinan Shen

Data depth is a concept in multivariate statistics that measures the centrality of a point in a given data cloud in $\IR^d$. If the depth of a point can be represented as the minimum of the depths with respect to all one-dimensional…

Computation · Statistics 2020-07-17 Rainer Dyckerhoff , Pavlo Mozharovskyi , Stanislav Nagy

Mean estimation is a fundamental task in statistics and a focus within differentially private statistical estimation. While univariate methods based on the Gaussian mechanism are widely used in practice, more advanced techniques such as the…

Machine Learning · Computer Science 2025-02-27 Gavin Brown , Lydia Zakynthinou

We study the question of how to compute a point in the convex hull of an input set $S$ of $n$ points in ${\mathbb R}^d$ in a differentially private manner. This question, which is trivial non-privately, turns out to be quite deep when…

Data Structures and Algorithms · Computer Science 2020-03-31 Haim Kaplan , Micha Sharir , Uri Stemmer

The angular halfspace depth (ahD) is a natural modification of the celebrated halfspace (or Tukey) depth to the setup of directional data. It allows us to define elements of nonparametric inference, such as the median, the inter-quantile…

Statistics Theory · Mathematics 2024-02-14 Stanislav Nagy , Petra Laketa

Given data in $\mathbb{R}^{p}$, a Tukey $\kappa$-trimmed region is the set of all points that have at least Tukey depth $\kappa$ w.r.t. the data. As they are visual, affine equivariant and robust, Tukey regions are useful tools in…

Computation · Statistics 2018-11-09 Xiaohui Liu , Karl Mosler , Pavlo Mozharovskyi

Statistical depths provide a fundamental generalization of quantiles and medians to data in higher dimensions. This paper proposes a new type of globally defined statistical depth, based upon control theory and eikonal equations, which…

Statistics Theory · Mathematics 2022-01-17 Martin Molina-Fructuoso , Ryan Murray

During the past two decades there has been a lot of interest in developing statistical depth notions that generalize the univariate concept of ranking to multivariate data. The notion of depth has also been extended to regression models and…

Methodology · Statistics 2015-08-18 Peter J. Rousseeuw , Mia Hubert

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…

dg-ga · Mathematics 2008-02-03 Dirk Ferus , Franz Pedit

Regression depth, introduced by Rousseeuw and Hubert in 1999, is a notion that measures how good of a regression hyperplane a given query hyperplane is with respect to a set of data points. Under projective duality, this can be interpreted…

Computational Geometry · Computer Science 2023-02-16 Patrick Schnider , Pablo Soberón

Depth measures quantify central tendency in the analysis of statistical and geometric data. Selecting a depth measure that is simple and efficiently computable is often important, e.g., when calculating depth for multiple query points or…

Computational Geometry · Computer Science 2024-11-12 Amirhossein Mashghdoust , Stephane Durocher

Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…

Computational Geometry · Computer Science 2016-09-29 Sariel Har-Peled , Micha Sharir

Robust estimation of location is a fundamental problem in statistics, particularly in scenarios where data contamination by outliers or model misspecification is a concern. In univariate settings, methods such as the sample median and…

Statistics Theory · Mathematics 2025-05-07 Alejandro Cholaquidis , Ricardo Fraiman , Leonardo Moreno , Gonzalo Perera

Starting with Tukey's pioneering work in the 1970's, the notion of depth in statistics has been widely extended especially in the last decade. These extensions include high dimensional data, functional data, and manifold-valued data. In…

Statistics Theory · Mathematics 2020-11-24 Alejandro Cholaquidis , Ricardo Fraiman , Fabrice Gamboa , Leonardo Moreno

We prove almost tight bounds on incidences between points and $k$-dimensional varieties of bounded degree in $\R^d$. Our main tools are the Polynomial Ham Sandwich Theorem and induction on both the dimension and the number of points.

Combinatorics · Mathematics 2017-03-17 Jozsef Solymosi , Terence Tao