Higher connectivity of fiber graphs of Gröbner basesReportar como inadecuado



 Higher connectivity of fiber graphs of Gröbner bases


Higher connectivity of fiber graphs of Gröbner bases - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Descargar gratis o leer online en formato PDF el libro: 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.



Autor: Samu Potka

Fuente: https://archive.org/







Documentos relacionados