Two Lower Bounds for Random Point Sets via Negative Association - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Two Lower Bounds for Random Point Sets via Negative Association

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image

Dates et versions

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

Licence

Paternité

Identifiants

  • HAL Id : hal-04320184 , version 1

Citer

Denys Bulavka, Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc. Two Lower Bounds for Random Point Sets via Negative Association. 2023. ⟨hal-04320184⟩
77 Consultations
26 Téléchargements

Partager

Gmail Facebook X LinkedIn More