Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes

Gilles Bonnet, Daniel Dadush, Uri Grupel +2

The combinatorial diameter $\mathrm{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…