creator Dillon, Martin advisor Petrović, Sonja In 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. Submitted by Erma Thomas (thomase@iit.edu) on 2016-07-20T20:04:27Z No. of bitstreams: 1 etdadmin_upload_426010.zip: 249786 bytes, checksum: da57796503b96f883a65d97a8293d347 (MD5) Made available in DSpace on 2016-07-20T20:04:27Z (GMT). No. of bitstreams: 1 etdadmin_upload_426010.zip: 249786 bytes, checksum: da57796503b96f883a65d97a8293d347 (MD5) Previous issue date: 2016-05 M.S. in Applied Mathematics, May 2016 2016 2016-05 en Algebraic Statistics Conductance Markov Chain Random Graph Statistics Thesis born digital application/pdf In Copyright http://rightsstatements.org/page/InC/1.0/ Restricted Access MATH / Applied Mathematics Illinois Institute of Technology Affiliated department http://hdl.handle.net/10560/islandora:6864