Stein's Method for Stationary Distributions of Markov Chains and Application to Ising Models

12/15/2017
by   Guy Bresler, et al.
0

We develop a new technique, based on Stein's method, for comparing two stationary distributions of irreducible Markov Chains whose update rules are `close enough'. We apply this technique to compare Ising models on d-regular expander graphs to the Curie-Weiss model (complete graph) in terms of pairwise correlations and more generally kth order moments. Concretely, we show that d-regular Ramanujan graphs approximate the kth order moments of the Curie-Weiss model to within average error k/√(d) (averaged over the size k subsets). The result applies even in the low-temperature regime; we also derive some simpler approximation results for functionals of Ising models that hold only at high enough temperatures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Subgeometric ergodicity and β-mixing

It is well known that stationary geometrically ergodic Markov chains are...
research
10/24/2022

Ising Models on Dense Regular Graphs

In this paper, we derive the limit of experiments for one parameter Isin...
research
05/12/2022

Faster quantum mixing of Markov chains in non-regular graph with fewer qubits

Sampling from the stationary distribution is one of the fundamental task...
research
06/08/2021

Markov Chains Generated by Convolutions of Orthogonality Measures

About two dozens of exactly solvable Markov chains on one-dimensional fi...
research
06/23/2022

On Convergence of a Truncation Scheme for Approximating Stationary Distributions of Continuous State Space Markov Chains and Processes

In the analysis of Markov chains and processes, it is sometimes convenie...
research
04/06/2023

On the tractability of sampling from the Potts model at low temperatures via Swendsen–Wang dynamics

Sampling from the q-state ferromagnetic Potts model is a fundamental que...
research
10/24/2018

Loop corrections in spin models through density consistency

Computing marginal distributions of discrete or semi-discrete Markov Ran...

Please sign up or login with your details

Forgot password? Click here to reset