arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.09322math.COmath.PR
收藏

随机竞赛图的几何

The geometry of random tournaments

University of California, Berkeley(加州大学伯克利分校)

Mario Sanchez, Brett Kolesnik

AI总结:

该研究利用凸几何中的zonotope,给出Landau定理(刻画完全图得分序列)和Moon定理(随机竞赛图平均得分序列充要条件)的简短自然证明,且证明适用于任意图。

摘要:

竞赛图是图的一种定向,每条边代表一场比赛,指向获胜方。得分序列列出每支队伍的获胜次数。Landau(1953)刻画了完全图的得分序列。Moon(1963)证明了相同条件对于随机竞赛图的平均得分序列是充要的。我们使用凸几何中的zonotope(zonotope是立方体的线性像),给出适用于任意图的这些结果的简短自然证明。Moon定理通过将立方体元素与分布、线性映射与期望算子对应得出。我们对Landau定理的证明结合了zonotope平铺与混合细分理论。我们还证明任意平均得分序列可由这样的竞赛图实现:在子森林内随机,其余部分确定。

英文摘要:

A tournament is an orientation of a graph. Each edge represents a match, directed towards the winner. The score sequence lists the number of wins by each team. Landau (1953) characterized score sequences of the complete graph. Moon (1963) showed that the same conditions are necessary and sufficient for mean score sequences of random tournaments. We present short and natural proofs of these results that work for any graph using zonotopes from convex geometry. A zonotope is a linear image of a cube. Moon's Theorem follows by identifying elements of the cube with distributions and the linear map as the expectation operator. Our proof of Landau's Theorem combines zonotopal tilings with the theory of mixed subdivisions. We also show that any mean score sequence can be realized by a tournament that is random within a subforest, and deterministic otherwise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑