Abstract: We prove the conjecture by Diaconis and Eriksson (2006) that the Markov degree of the Birkhoff model is three. In fact, we prove the conjecture in a generalization of the Birkhoff model, where each voter is asked to rank a fixed number, say r, of candidates among all candidates. We also give an exhaustive characterization of Markov bases for small r.
Recommendations
- The three-state toric homogeneous Markov chain model has Markov degree two
- Degree bounds for a minimal Markov basis for the three-state toric homogeneous Markov chain model
- Markov degree of the three-state toric homogeneous Markov chain model
- Markov bases of binary graph models
- Limiting distributions for continuous state Markov voting models
Cites work
- An extension of the polytope of doubly stochastic matrices
- Commutative algebra of statistical ranking
- Compressed polytopes and statistical disclosure limitation
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Generating uniformly distributed random latin squares
- Markov bases for noncommutative Fourier analysis of ranked data
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- Quadratic Gröbner bases for smooth \(3\times 3\) transportation polytopes
Cited in
(6)- On the equations and classification of toric quiver varieties
- Low dimensional flow polytopes and their toric ideals
- Moment Varieties for Mixtures of Products
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Existence of unimodular triangulations -- positive results
- The Markov complexity of book graphs
This page was built for publication: Markov degree of the Birkhoff model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402946)
