Markov bases: a 25 year update

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.

READ FULL TEXT
research
10/14/2020

Central Limit Theorem and Moderate deviation for nonhomogenenous Markov chains

Our purpose is to prove central limit theorem for countable nonhomogeneo...
research
03/14/2019

Modified log-Sobolev inequalities for strongly log-concave distributions

We show that the modified log-Sobolev constant for a natural Markov chai...
research
08/30/2020

Improving graduation rate estimates using regularly updated Markov chains

American universities use a rolling six-year graduation rate (SYGR) to c...
research
10/07/2017

Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo

A key task in Bayesian statistics is sampling from distributions that ar...
research
07/30/2019

Feasible bases for a polytope related to the Hamilton cycle problem

We study a certain polytope depending on a graph G and a parameter β∈(0,...
research
11/23/2017

Markov chain Hebbian learning algorithm with ternary synaptic units

In spite of remarkable progress in machine learning techniques, the stat...
research
12/24/2021

Application of Markov Structure of Genomes to Outlier Identification and Read Classification

In this paper we apply the structure of genomes as second-order Markov p...

Please sign up or login with your details

Forgot password? Click here to reset