In statistics, we ask whether some statistical model ts observed data. We use a Markov chain proposed by Gross, Petrovi c, and Stasi to... Show moreIn statistics, we ask whether some statistical model ts observed data. We use a Markov chain proposed by Gross, Petrovi c, and Stasi to perform exact testing for the p1 random graph model. By comparing it to the simple switch Markov chain, we prove that it mixes rapidly on many classes of degree sequences, and we discuss why it is sometimes better suited than the simple switch chain, and try to easily introduce the concepts from the general theory along the way. M.S. in Applied Mathematics, May 2016 Show less
