Author:
Chikina Maria,Frieze Alan,Pegden Wesley
Abstract
We present a statistical test to detect that a presented state of a reversible Markov chain was not chosen from a stationary distribution. In particular, given a value function for the states of the Markov chain, we would like to show rigorously that the presented state is an outlier with respect to the values, by establishing a p value under the null hypothesis that it was chosen from a stationary distribution of the chain. A simple heuristic used in practice is to sample ranks of states from long random trajectories on the Markov chain and compare these with the rank of the presented state; if the presented state is a 0.1% outlier compared with the sampled ranks (its rank is in the bottom 0.1% of sampled ranks), then this observation should correspond to a p value of 0.001. This significance is not rigorous, however, without good bounds on the mixing time of the Markov chain. Our test is the following: Given the presented state in the Markov chain, take a random walk from the presented state for any number of steps. We prove that observing that the presented state is an ε-outlier on the walk is significant at p=2ε under the null hypothesis that the state was chosen from a stationary distribution. We assume nothing about the Markov chain beyond reversibility and show that significance at p≈ε is best possible in general. We illustrate the use of our test with a potential application to the rigorous detection of gerrymandering in Congressional districting.
Funder
NSF | Directorate for Mathematical and Physical Sciences
NSF | Directorate for Computer and Information Science and Engineering
Publisher
Proceedings of the National Academy of Sciences
Reference24 articles.
1. Inference from Iterative Simulation Using Multiple Sequences
2. Gelman A Rubin DB (1992) A single series from the Gibbs sampler provides a false sense of security. Bayesian Statistics 4: Proceedings of the Fourth Valencia International Meeting, eds Bernardo JM Berger JO Dawid AP Smith AFM (Clarendon), (Clarendon, Gloucestershire, UK), pp 625–631.
3. Nonuniversal critical dynamics in Monte Carlo simulations
4. Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point;Borgs;Probab Theory Relat Fields,2012
5. Mixing properties of the Swendsen-Wang process on classes of graphs;Cooper;Random Struct Algorithms,1999
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献