English
Related papers

Related papers: Depth with respect to a family of convex sets

200 papers

We introduce a class of depth-based classification procedures that are of a nearest-neighbor nature. Depth, after symmetrization, indeed provides the center-outward ordering that is necessary and sufficient to define nearest neighbors. Like…

Statistics Theory · Mathematics 2015-04-06 Davy Paindaveine , Germain Van Bever

We develop a novel exploratory tool for non-Euclidean object data based on data depth, extending the celebrated Tukey's depth for Euclidean data. The proposed metric halfspace depth, applicable to data objects in a general metric space,…

Methodology · Statistics 2021-09-02 Xiongtao Dai , Sara Lopez-Pintado

Notions of depth in regression have been introduced and studied in the literature. Regression depth (RD) of Rousseeuw and Hubert (1999), the most famous one, is a direct extension of Tukey location depth (Tukey (1975)) to regression. Like…

Statistics Theory · Mathematics 2020-07-13 Yijun Zuo

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

Let $[n]$ (resp. $V$) be an $n$-element set (resp. $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$), and $\binom{[n]}{k}$ (resp. $\genfrac{[}{]}{0pt}{}{V}{k}$) denote the set of all $k$-subsets of $[n]$ (resp.…

Combinatorics · Mathematics 2026-05-25 Shuhui Yu , Lijun Ji

Let F be a family of positive homothets (or translates) of a given convex body K in R^n. We investigate two approaches to measuring the complexity of F. First, we find an upper bound on the transversal number $\tau(F)$ of F in terms of $n$…

Metric Geometry · Mathematics 2010-04-09 Márton Naszódi , Steven Taschuk

Pick $n$ independent and uniform random points $U_1,\ldots,U_n$ in a compact convex set $K$ of $\mathbb{R}^d$ with volume 1, and let $P^{(d)}_K(n)$ be the probability that these points are in convex position. The Sylvester conjecture in…

Combinatorics · Mathematics 2024-11-14 Jean-François Marckert , Ludovic Morin

Let $K\subset\mathbb R^d$ be a compact subset equipped with a $\delta$-Ahlfors regular measure $\mu$. For any $\tau>1/d$ and any ``inhomogeneous'' vector $\boldsymbol{\theta}\in\mathbb R^d$, let $W_d(\psi_\tau,\boldsymbol{\theta})$ denote…

Number Theory · Mathematics 2026-02-17 Yubin He , Lingmin Liao

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

A family $\mathcal{F}$ of subsets of a set $X$ is $t$-intersecting if $\vert A_i \cap A_j \vert \geq t$ for every $A_i, \; A_j \in \mathcal{F}$. We study intersecting families in the Hamming geometry. Given $X=\mathbb{F}_q^3$ a vector space…

Combinatorics · Mathematics 2014-04-02 Anderson N. Martinhão , Emerson L. Monte Carmelo

A family $\mathcal F\subset {[n]\choose k}$ is $U(s,q)$ of for any $F_1,\ldots, F_s\in \mathcal F$ we have $|F_1\cup\ldots\cup F_s|\le q$. This notion generalizes the property of a family to be $t$-intersecting and to have matching number…

Combinatorics · Mathematics 2021-01-01 Peter Frankl , Andrey Kupavskii

The ball hypergraph of a graph $G$ is the family of balls of all possible centers and radii in $G$. It has Helly number at most $k$ if every subfamily of $k$-wise intersecting balls has a nonempty common intersection. A graph is $k$-Helly…

Data Structures and Algorithms · Computer Science 2020-11-03 Guillaume Ducoffe

Let $K$ be a field, $A$ a standard graded $K$-algebra and $M$ a finitely generated graded $A$-module. Inspired by our previous works, we study the Hilbert depth of $h_M$, that is $$\operatorname{hdepth}(h_M)=\max\{d\;:\; \sum\limits_{j\leq…

Commutative Algebra · Mathematics 2024-02-20 Silviu Balanescu , Mircea Cimpoeas

The concept of illumination bodies studied in convex geometry is used to amend the halfspace depth for multivariate data. The proposed notion of illumination enables finer resolution of the sample points, naturally breaks ties in the…

Statistics Theory · Mathematics 2021-05-28 Stanislav Nagy , Jiří Dvořák

Let $h:\mathbb Z \to \mathbb Z_{\geq 0}$ be a nonzero function with $h(k)=0$ for $k\ll 0$. We define the Hilbert depth of $h$ by $\operatorname{hdepth}(h)=\max\{d\;:\; \sum_{j\leq k} (-1)^{k-j}\binom{d-j}{k-j}h(j)\geq 0\text{ for all }k\leq…

Number Theory · Mathematics 2024-02-20 Silviu Balanescu , Mircea Cimpoeas

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

Combinatorics · Mathematics 2019-07-02 Ferdinand Ihringer , Andrey Kupavskii

We define a $C(k)$ to be a family of $k$ sets $F_1,\dots,F_k$ such that $\textrm{conv}(F_i\cup F_{i+1})\cap \textrm{conv}(F_j\cup F_{j+1})=\emptyset$ when $\{i,i+1\}\cap \{j,j+1\}=\emptyset$ (indices are taken modulo $k$). We show that if…

Combinatorics · Mathematics 2022-04-25 Daniel McGinnis

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…

General Topology · Mathematics 2019-01-31 Szymon Dolecki , Andrzej Starosolski

For an integer $d \geq 2$, a family $\mathcal{F}$ of sets is $\textit{$d$-wise intersecting}$ if for any distinct sets $A_1,A_2,\dots,A_d \in \mathcal{F}$, $A_1 \cap A_2 \cap \dots \cap A_d \neq \emptyset$, and $\textit{non-trivial}$ if…

Combinatorics · Mathematics 2019-11-05 Jason O'Neill , Jacques Verstraete

We prove discrete Helly-type theorems for pseudohalfplanes, which extend recent results of Jensen, Joshi and Ray about halfplanes. Among others we show that given a family of pseudohalfplanes $\cal H$ and a set of points $P$, if every…

Combinatorics · Mathematics 2021-10-05 Balázs Keszegh