# Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions

The Maximal points in a set S are those that aren't dominated by any other point in S. Such points arise in multiple application settings in which they are called by a variety of different names, e.g., maxima, Pareto optimums, skylines. Because of their ubiquity, there is a large literature on the expected number of maxima in a set S of n points chosen IID from some distribution. Most such results assume that the underlying distribution is uniform over some spatial region and strongly use this uniformity in their analysis. This work was initially motivated by the question of how this expected number changes if the input distribution is perturbed by random noise. More specifically, let Ballp denote the uniform distribution from the 2-d unit Lp ball, delta Ballq denote the 2-d Lq-ball, of radius delta and Ballpq be the convolution of the two distributions, i.e., a point v in Ballp is reported with an error chosen from delta Ballq. The question is how the expected number of maxima change as a function of delta. Although the original motivation is for small delta the problem is well defined for any delta and our analysis treats the general case. More specifically, we study, as a function of n,δ, the expected number of maximal points when the n points in S are chosen IID from distributions of the type Ballpq where p,q in 1,2,infty for delta > 0 and also of the type Ballp infty-q, where q in [1,infty) for delta > 0.

• 7 publications
• 9 publications
research
03/02/2020

### Holes and islands in random point sets

For d ∈ℕ, let S be a finite set of points in ℝ^d in general position. A ...
research
02/09/2010

### Probabilistic Recovery of Multiple Subspaces in Point Clouds by Geometric lp Minimization

We assume data independently sampled from a mixture distribution on the ...
research
12/06/2022

### On the Size of Chromatic Delaunay Mosaics

Given a locally finite set A ⊆ℝ^d and a coloring χ A →{0,1,…,s}, we intr...
research
12/03/2019

### Fast Algorithms for Geometric Consensuses

Let P be a set of n points in ^d in general position. A median hyperplan...
research
07/04/2018

### Optimal Ball Recycling

Balls-and-bins games have been a wildly successful tool for modeling loa...
research
02/14/2023

### Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP

2-Opt is probably the most basic local search heuristic for the TSP. Thi...
research
02/19/2020

### The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable

In this note, we construct an algorithm that, on input of a description ...