Markov bases for noncommutative Fourier analysis of ranked data

Abstract

To calibrate Fourier analysis of $S_5$ ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a new statistical analysis of two data sets. The calculation involves a large Gröbner basis computation (45825 generators), but reduction to a minimal basis and reduction by natural symmetries leads to a remarkably small basis (14 elements). Although the Gröbner basis calculation is infeasible for $S_6$, we exploit the symmetry of the problem to calculate a Markov basis for $S_6$ with 7,113,390 elements in 58 symmetry classes. We improve a bound on the degree of the generators for a Markov basis for $S_n$ and conjecture that this ideal is generated in degree 3.

16 pages, 2 figures. To appear in the Journal of Symbolic Computation, special issue on Computational Algebraic Statistics. Minor edits, some small corrections for the S_6 numbers, added download location for code

Cited by in corpus (7)

• Existence of unimodular triangulations - positive results
• Representation Theory of the Symmetric Group in Voting Theory and Game Theory
• Markov degree of the Birkhoff model
• Markov degree of configurations defined by fibers of a configuration
• A Multiresolution Analysis Framework for the Statistical Analysis of Incomplete Rankings
• $c$-Birkhoff polytopes
• Toric ideal of matching polytopes and edge colorings