Higher connectivity of fiber graphs of Gröbner basesReport as inadecuate



 Higher connectivity of fiber graphs of Gröbner bases


Higher connectivity of fiber graphs of Gröbner bases - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Higher connectivity of fiber graphs of Gröbner bases
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.



Author: Samu Potka

Source: https://archive.org/







Related documents