We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank $3$): (a) The number of extreme points in an $n$-point order type, chosen uniformly at random from all such order types, is on average $4+o(1)$. For labeled order types, this number has average $4- \frac{8}{n^2 - n +2}$ and variance at most $3$. (b) The (labeled) order types read off a set of $n$ points sampled independently from the uniform measure on a convex planar domain, smooth or polygonal, or from a Gaussian distribution are concentrated, i.e. such sampling typically encounters only a vanishingly small fraction of all order types of the gi...
Assume K ⊂ Rd is a convex body and X is a (large) finite subset of K. How many convex polytopes are ...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
International audienceWe establish the following two main results on order types of points in genera...
AbstractGoodman and Pollack have asked to estimate the probabilities of order types by using a unifo...
We apply ideas from the theory of limits of dense combinatorial structures to study order types, whi...
AbstractThe Edelman–Jamison problem is to characterize those abstract convex geometries that are rep...
Let $P$ be a set of $n$ random points chosen uniformly in the unit square. In this paper, we examine...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
International audienceWe present a simple technique for analyzing the size of geometric hypergraphs ...
This thesis is focused on problems related to the theory of combinatorial limits.This theory opened ...
AbstractThe convex hull of a set of independent random points sampled from three types of sphericall...
In this work we study a class of random convex sets that "interpolate" between polytopes and zonotop...
Let ENn be the expected number of extreme points among n i.i.d. points with a common radially symmet...
Assume K ⊂ Rd is a convex body and X is a (large) finite subset of K. How many convex polytopes are ...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
International audienceWe establish the following two main results on order types of points in genera...
AbstractGoodman and Pollack have asked to estimate the probabilities of order types by using a unifo...
We apply ideas from the theory of limits of dense combinatorial structures to study order types, whi...
AbstractThe Edelman–Jamison problem is to characterize those abstract convex geometries that are rep...
Let $P$ be a set of $n$ random points chosen uniformly in the unit square. In this paper, we examine...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
International audienceWe present a simple technique for analyzing the size of geometric hypergraphs ...
This thesis is focused on problems related to the theory of combinatorial limits.This theory opened ...
AbstractThe convex hull of a set of independent random points sampled from three types of sphericall...
In this work we study a class of random convex sets that "interpolate" between polytopes and zonotop...
Let ENn be the expected number of extreme points among n i.i.d. points with a common radially symmet...
Assume K ⊂ Rd is a convex body and X is a (large) finite subset of K. How many convex polytopes are ...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...