Assessing significance in a Markov chain without mixing

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

Subject

Multidisciplinary

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篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3