Related papers: On the complexity of random polytopes
We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms. In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small…
We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already…
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models, the predicted choice probabilities often form a bounded and…
The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…
Frank-Wolfe methods are popular for optimization over a polytope. One of the reasons is because they do not need projection onto the polytope but only linear optimization over it. To understand its complexity, Lacoste-Julien and Jaggi…
We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…
We examine the task of locating a target region among those induced by intersections of $n$ halfspaces in $\mathbb{R}^d$. This generic task connects to fundamental machine learning problems, such as training a perceptron and learning a…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…
Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In…
We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
Developing robust representations of chemical structures that enable models to learn topological inductive biases is challenging. In this manuscript, we present a representation of atomistic systems. We begin by proving that our…
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…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d…
One measure of geometrical complexity of a spatial curve is the number of crossings in a planar projection of the curve. For $N$-noded ring polymers with a fixed knot type, we evaluate numerically the average of the crossing number over…