Related papers: On Expected Face Numbers of Random Beta and Beta' …

This article gives a formula for associated Stirling numbers of the second kind based on the moment of a sum of independent random variables having a beta distribution. From this formula we deduce, using probabilistic approaches, lower and…

The symmetric convex hull of random points that are independent and distributed according to the cone probability measure on the $\ell_p$-unit sphere of $\mathbb R^n$ for some $1\leq p < \infty$ is considered. We prove that these random…

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the…

We study the statistical properties of the convex hull of a planar run-and-tumble particle (RTP), also known as the "persistent random walk", where the particle/walker runs ballistically between tumble events at which it changes its…

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

A $\delta$-vector $\delta(\Pc)= (\delta_0, \delta_1, ..., \delta_d)$ is called shifted symmetric if $\delta_{d-i} = \delta_{i+1}$ for each $0 \leq i \leq [(d-1)/2]$. A natural family of $(0,1)$-polytopes with shifted symmetric…

Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

Let $\{X_i\}_{i=1}^{\infty}$ be a sequence of independent copies of a random vector $X$ in $\mathbb{R}^n$. We revisit the question to determine the asymptotic shape of the random polytope $K_N={\rm conv}\{X_1,\ldots ,X_N\}$ where $N>n$. We…

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

The classical theorem of Wendel provides an exact formula for the probability that the convex hull of independent symmetrically distributed vectors in ${\mathbb R}^d$ contains the origin as long as the distributions of the vectors are…

We prove some "high probability" results on the expected value of the mean width for random perturbations of random polytopes. The random perturbations are considered for Gaussian and $p$-stable random vectors, as well as uniform…

A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

We study the geometry of centrally-symmetric random polytopes, generated by $N$ independent copies of a random vector $X$ taking values in $\mathbb{R}^n$. We show that under minimal assumptions on $X$, for $N \gtrsim n$ and with high…

We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of $n$ points in $\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the convex hull of…

We study the $O_\beta$-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle $\beta$. Given a set $P$ of $n$ points in the plane, we show how to maintain the $O_\beta$-hull of $P$…