2000 character limit reached
Rapid mixing and Markov bases (1505.03018v3)
Published 12 May 2015 in math.CO, math.ST, and stat.TH
Abstract: The mixing behaviour of random walks on lattice points of polytopes using Markov bases is examined. It is shown that under a dilation of the underlying polytope, these random walks do not mix rapidly when a fixed Markov basis is used. We also show that this phenomenon does not disappear after adding more moves to the Markov basis. Avoiding rejections by sampling applicable moves does also not lead to an asymptotic improvement. As a way out, a method of how to adapt Markov bases in order to achieve the fastest mixing behaviour is introduced.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.