2019/11/06 by Benjamini, Itai, Lubetzky, Eyal, Peled, Yuval
#57M20 #60C05 #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR)
paper · doi:10.48550/arxiv.1911.02569
We study the minimum total weight of a disk triangulation using vertices out of \1,…,n\, where the boundary is the triangle (123) and the \binomn3 triangles have independent weights, e.g. Exp(1) or U(0,1). We show that for explicit constants c1,c2>0, this minimum is c1 (log n)/(√ n) + c2 (loglog n)/(√ n) + (Yn)/(√ n) where the random variable Yn is tight, and it is attained by a triangulation that consists of \frac14log n + OP(√(log n)) vertices. Moreover, for disk triangulations that are canonical, in that no inner triangle contains all but O(1) of the vertices, the minimum weight has the above form with the law of Yn converging weakly to a shifted~Gumbel. In addition, we prove that, with high probability, the minimum weights of a homological filling and a homotopical filling of the cycle (123) are both attained by the minimum weight disk triangulation.