Abstract
Given a finite set of points S, two measures of the depth of a query point χ with respect to S are the Simplicial depth of Liu and the Halfspace depth of Tukey (also known as Location depth). We show that computing these depths requires Ω(n log n) time, which matches the upper bound complexities of the algorithms of Rousseeuw and Ruts. Our lower bound proofs may also be applied to two bivariate sign tests: that of Hodges, and that of Oja and Nyblom.
Original language | English (US) |
---|---|
Pages (from-to) | 223-229 |
Number of pages | 7 |
Journal | Computational Statistics and Data Analysis |
Volume | 40 |
Issue number | 2 |
DOIs | |
State | Published - Aug 28 2002 |
Keywords
- Halfspace depth
- Liu
- Sign tests
- Simplical depth
- Tukey
ASJC Scopus subject areas
- Statistics and Probability
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics