Two Lower Bounds for Random Point Sets via Negative Association - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Two Lower Bounds for Random Point Sets via Negative Association

Abstract

We present two lower bounds that hold with high probability for random point sets. We first give a new, and elementary, proof that the classical models of random point sets (uniform in a smooth convex body, uniform in a polygon, Gaussian) have a superconstant number of extreme points with high probability. We next prove that any algorithm that determines the orientation of all triples in a planar set of n points (that is, the order type of the point set) from their Cartesian coordinates must read with high probability $4n \log n − O(n \log \log n)$ coordinate bits. This matches previously known upper bounds. Both bounds rely on a method due to Dubhashi and Ranjan (Random Structures and Algorithms, 1998) for obtaining concentration results via a negative association property.
Fichier principal
Vignette du fichier
hal.pdf (1.44 Mo) Télécharger le fichier
Vignette du fichier
vignette.png (98.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Format Figure, Image

Dates and versions

hal-04320184 , version 1 (04-12-2023)

Licence

Identifiers

  • HAL Id : hal-04320184 , version 1

Cite

Denys Bulavka, Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc. Two Lower Bounds for Random Point Sets via Negative Association. 2023. ⟨hal-04320184⟩
79 View
31 Download

Share

Gmail Mastodon Facebook X LinkedIn More