Monotonicity of expected $f$-vectors for projections of regular polytopes

混合随机β-多胞形

Mixed random beta-polytopes

本文将β分布随机多胞形平均体积的结果推广至非同分布情形，推导了广义混合β-多胞形的期望体积与Wieacker泛函的期望值，拓展了已有研究，证明用到Blaschke–Petkantschin公式等技术。

实高斯指数和通过实矩映射

Real Gaussian exponential sums via a real moment map

本文通过实矩映射研究高斯指数和系统的期望解数，将其化为牛顿多胞体上的积分，并证明添加支撑点可导致解数减少，否定局部猜想，同时给出Aronszajn乘法新下界。

Mean width of regular polytopes and expected maxima of correlated Gaussian variables

An old conjecture states that among all simplices inscribed in the unit sphere the regular one has the maximal mean width. An equivalent formulation is that for any centered Gaussian vector $(ξ_1,\dots,ξ_n)$ satisfying $\mathbb Eξ_1^2= \dots =\mathbb Eξ_n^2=1$ one has $$ \mathbb E\,\max\{ξ_1,\dots,ξ_n\}\leq\sqrt{\frac{n}{n-1}}\, \mathbb E\,\max\{η_1,\dots,η_n\}, $$ where $η_1,η_2,\dots,$ are independent standard Gaussian variables. Using this probabilistic interpretation we derive an asymptotic version of the conjecture. We also show that the mean width of the regular simplex with $2n$ vertice…

Angle sums of random polytopes

For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the expected sums of internal and external angles at all faces of any fixed dimension. The first family are the Gaussian polytopes defined as convex hulls of i.i.d. samples from a non-degenerate Gaussian distribution in $\mathbb R^d$. The second family are convex hulls of random walks with exchangeable increments satisfying certain mild general position assumptio…

The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes

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 introduced a condition number for polytopes and showed linear convergence for several variations of the method. The actual running time can still be exponential in the worst case (when the condition number is exponential). We study the smoothed complexity of the condition number, namely the condition number of small random perturbations of the input polytope and …

Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes

The combinatorial diameter $\operatorname{diam}(P)$ of a polytope $P$ is the maximum shortest path distance between any pair of vertices. In this paper, we provide upper and lower bounds on the combinatorial diameter of a random "spherical" polytope, which is tight to within one factor of dimension when the number of inequalities is large compared to the dimension. More precisely, for an $n$-dimensional polytope $P$ defined by the intersection of $m$ i.i.d.\ half-spaces whose normals are chosen uniformly from the sphere, we show that $\operatorname{diam}(P)$ is $Ω(n m^{\frac{1}{n-1}})$ and $O(…

Universality in polytope phase transitions and message passing algorithms

We consider a class of nonlinear mappings $\mathsf{F}_{A,N}$ in $\mathbb{R}^N$ indexed by symmetric random matrices $A\in\mathbb{R}^{N\times N}$ with independent entries. Within spin glass theory, special cases of these mappings correspond to iterating the TAP equations and were studied by Bolthausen [Comm. Math. Phys. 325 (2014) 333-366]. Within information theory, they are known as "approximate message passing" algorithms. We study the high-dimensional (large $N$) behavior of the iterates of $\mathsf{F}$ for polynomial functions $\mathsf{F}$, and prove that it is universal; that is, it depen…