English
Related papers

Related papers: On random approximations by generalized disc-polyg…

200 papers

Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…

Probability · Mathematics 2024-10-16 Ludovic Morin

The generalized circumradius of a set of points $A \subseteq \mathbb{R}^d$ with respect to a convex body $K$ equals the minimum value of $\lambda \geq 0$ such that $A$ is contained in a translate of $\lambda K$. Each choice of $K$ gives a…

Metric Geometry · Mathematics 2023-02-02 David Bryant , Katharina T. Huber , Vincent Moulton , Paul F. Tupper

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…

Number Theory · Mathematics 2020-06-03 Or Ordentlich , Oded Regev , Barak Weiss

In this paper we compare the different phenomena that occur when intersecting geometric objects with random geodesics on the unit sphere and inside convex bodies. On the high dimensional sphere we see that with probability bounded away from…

Functional Analysis · Mathematics 2018-09-25 Uri Grupel

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

Probability · Mathematics 2022-01-11 M. Reitzner , C. Schuett , E. M. Werner

A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…

Statistics Theory · Mathematics 2020-06-23 Alejandro Cholaquidis , Antonio Cuevas

Lorentzian and completely log-concave polynomials have recently emerged as a unifying framework for negative dependence, log-concavity, and convexity in combinatorics and probability. We extend this theory to variational analysis and…

Optimization and Control · Mathematics 2026-03-11 Papri Dey

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

Metric Geometry · Mathematics 2019-05-01 Galyna V. Livshyts

We construct examples of two convex bodies $K,L$ in $\mathbb{R}^n$, such that every projection of $K$ onto a $(n-1)$-dimensional subspace can be rotated to be contained in the corresponding projection of $L$, but $K$ itself cannot be…

Metric Geometry · Mathematics 2015-05-22 M. Angeles Alfonseca , Michelle Cordier

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

Probability · Mathematics 2022-10-24 Arturo Jaramillo , James Melbourne

Motivated by long-standing conjectures on the discretization of classical inequalities in the Geometry of Numbers, we investigate a new set of parameters, which we call \emph{packing minima}, associated to a convex body $K$ and a lattice…

Metric Geometry · Mathematics 2021-01-20 Martin Henk , Matthias Schymura , Fei Xue

The central limit theorem for convex bodies says that with high probability the marginal of an isotropic log-concave distribution along a random direction is close to a Gaussian, with the quantitative difference determined asymptotically by…

Functional Analysis · Mathematics 2019-10-01 Haotian Jiang , Yin Tat Lee , Santosh S. Vempala

We introduce a family of random $c$-L\"uroth transformations $\{L_c\}_{c \in [0, \frac12]}$, obtained by randomly combining the standard and alternating L\"uroth maps with probabilities $p$ and $1-p$, $0 < p < 1$, both defined on the…

Dynamical Systems · Mathematics 2021-01-07 Charlene Kalle , Marta Maggioni

In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…

Metric Geometry · Mathematics 2017-06-23 Benjamin Reichenwallner

Given a stationary and isotropic Poisson hyperplane process and a convex body $K$ in ${\mathbb R}^d$, we consider the random polytope defined by the intersection of all closed halfspaces containing $K$ that are bounded by hyperplanes of the…

Probability · Mathematics 2020-02-19 Rolf Schneider

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

Statistics Theory · Mathematics 2011-10-17 Lutz Duembgen , Richard Samworth , Dominic Schuhmacher

It was shown in \cite{GL} that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to a rotation invariant log-concave probability measure $\gamma$ is of order $\frac{\sqrt{n}}{\sqrt[4]{Var|X|} \sqrt{\mathbb{E}|X|}}$,…

Classical Analysis and ODEs · Mathematics 2014-09-17 Galyna V. Livshyts

A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…

Probability · Mathematics 2015-05-19 Imre Bárány , Daniel Hug , Matthias Reitzner , Rolf Schneider

Let $\varphi_{n,K}$ denote the largest angle in all the triangles with vertices among the $n$ points selected at random in a compact convex subset $K$ of $\mathbb{R}^d$ with nonempty interior, where $d\ge2$. It is shown that the…

Probability · Mathematics 2016-08-29 Iosif Pinelis

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

Computational Geometry · Computer Science 2020-03-10 Man-Kwun Chiu , Stefan Felsner , Manfred Scheucher , Patrick Schnider , Raphael Steiner , Pavel Valtr
‹ Prev 1 3 4 5 6 7 10 Next ›