标题： 格里布纳基的纤维图的更高连通性 显示英文标题

标题： Higher connectivity of fiber graphs of Gröbner bases

摘要： 从列联表中得到的Gröbner基的纤维图在统计假设检验中很重要，其中研究者使用Metropolis-Hastings算法在这些图上进行随机游走。 图的连通性对算法收敛速度有影响。 在本文中，我们使用基本的组合技术研究一类纤维图，并提供支持Engström最近提出的猜想的结果：连通性由最小顶点度给出。 显示英文摘要

摘要： Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The connectivity of the graphs has implications on how fast the algorithm converges. In this paper, we study a class of fiber graphs with elementary combinatorial techniques and provide results that support a recent conjecture of Engstr\"om: the connectivity is given by the minimum vertex degree.