Related papers: On random disc-polygons in a disc-polygon
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We show that there is no algorithm which, provided a polynomial number of random points uniformly distributed over a convex body in R^n, can approximate the volume of the body up to a constant factor with high probability.
Consider the Poincare disc model for hyperbolic geometry. In this paper, a convenient computational formula is developed along with an aesthetic geometric interpretation. Two proofs, one geometric and one analytical, of each result are…
We develop a calculus based on zonoids - a special class of convex bodies - for the expectation of functionals related to a random submanifold $Z$ defined as the zero set of a smooth vector valued random field on a Riemannian manifold. We…
We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…
Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
In Groeneboom (1988) a central limit theorem for the number of vertices of the convex hull of a uniform sample from the interior of convex polygon was derived. In the unpublished preprint Nagaev and Khamdamov (1991) (in Russian) a central…
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same…
The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…
In a $d$-dimensional convex body $K$ random points $X_0, \dots, X_d$ are chosen. Their convex hull is a random simplex. The expected volume of a random simplex is monotone under set inclusion, if $K \subset L$ implies that the expected…
We obtain uniform asymptotics for polynomials orthogonal on a fixed and varying arc of the unit circle with a positive analytic weight function. We also complete the proof of the large $s$ asymptotic expansion for the Fredholm determinant…
Starting with a collection of $n$ oriented polygonal discs, with an even number $N$ of sides in total, we generate a random oriented surface by randomly matching the sides of discs and properly gluing them together. Encoding the surface in…
The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…
Let n points be chosen randomly and independently in the unit disk. "Sylvester's question" concerns the probability p_n that they are the vertices of a convex n-sided polygon. Here we establish the link with another problem. We show that…
In this paper we deduce a universal result about the asymptotic distribution of roots of random polynomials, which can be seen as a complement to an old and famous result of Erdos and Turan. More precisely, given a sequence of random…
We continue to investigate cases when the Repov\v{s}-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces.…
In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.
Our main contribution is a concentration inequality for the symmetric volume difference of a $ C^2 $ convex body with positive Gaussian curvature and a circumscribed random polytope with a restricted number of facets, for any probability…
We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…