Markov bases: a 25 year update
Not on the map. Why?
Abstract (arXiv)
In this paper, we evaluate the challenges and best practices associated with the Markov bases approach to sampling from conditional distributions. We provide insights and clarifications after 25 years of the publication of the fundamental theorem for Markov bases by Diaconis and Sturmfels. In addition to a literature review we prove three new results on the complexity of Markov bases in hierarchical models, relaxations of the fibers in log-linear models, and limitations of partial sets of moves in providing an irreducible Markov chain.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Jun 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.
- 2026Learning Fast Monomial Orders for Gr"obner Basis Computations3 Feb 2026
- 2024Learning to sample fibers for goodness-of-fit testing22 May 2024