We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Higher Connectivity of Fiber Graphs of Gröbner Bases.
- Authors
Potka, Samu
- Abstract
Fiber graphs of Gröbner 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öm: the connectivity is given by the minimum vertex degree. 2000 Mathematics Subject Classifications: Primary 05C40; Secondary 13P25, 13P10, 62H17, 05C81
- Subjects
GROBNER bases; CONTINGENCY tables; STATISTICAL significance; COMBINATORICS; VERTEX operator algebras; CONVEX polytopes
- Publication
Journal of Algebraic Statistics, 2013, Vol 4, Issue 1, p93
- ISSN
1309-3452
- Publication type
Article
- DOI
10.18409/jas.v4i1.20