Higher Connectivity of Fiber Graphs of Gröbner Bases AS2012 Special Volume, part 2: This issue includes a second series of papers from talks, posters and collaborations resulting from and inspired by the Algebraic Statistics in the Alleghenies Conference at Penn State, which took place in July 2012. Fiber graphs, Gröbner bases, Markov bases, connectivity 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 ber 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. Potka, Samu 2013 2013 Article application/pdf islandora:1007824 http://hdl.handle.net/10560/islandora:1007824 MATH / Applied Mathematics Illinois Institute of Technology Journal of Algebraic Statistics en Open Access