Many Facets in Random Polytopes from Product and Log-Concave Measures
Silouanos Brazitikos, Minas Pafis
Abstract
We prove bounds of order nn/2eO(n) for the expected number of facets of high-dimensional random polytopes. First, let μ be a non-degenerate compactly supported even probability measure on satisfying μ([x-s,x]) sκ near its right endpoint x. For every sufficiently small fixed α>0, the convex hull of N= eαn independent points with law μ n has at least nn/2e-Cμ,αn expected facets; this includes all symmetric finite-alphabet distributions. For every full-dimensional log-concave probability measure on n, we prove that there exist T∈[n,2n] and N= eTn3/2 for which \[ nn/2e-Cn ≤ E fn-1(PN) ≤ nn/2eCn. \] Thus the scale nn/2, up to exponential factors, is universal for log-concave measures in this high-dimensional exponential regime. Finally, we construct a symmetric isotropic full-support non-log-concave counterexample with only (1+o(1))2n expected facets.
Create a lesson
Related papers
On Solutions to Graphon McKean-Vlasov SDEs of Nemytskii-type
Sebastian Grube, Guodong Pang, Michael Röckner
Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics
Seonwoo Kim, Sanha Lee, Insuk Seo
On the telegrapher's signals of sticky local times
F. Colantoni, M. D'Ovidio
p-roughness of paths and invariance of p-th variation
Rama Cont
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
Anna Kazeykina, Zhenjie Ren, Hecheng Wang
Delocalisation and scaling limit for the disordered long-range Discrete Gaussian Chain
Christopher Chalhoub, Paul Dario, Corentin Faipeur et al.