Rapid mixing of the switch Markov chain for strongly stable degree sequences. Issue 3 (20th July 2020)

• Record Type: Journal Article
• Authors: Amanatidis, Georgios; Kleer, Pieter
• Is Part Of: Random structures & algorithms. Volume 57:Issue 3(2020)
• Page Start: 637
• Page End: 657
• Publication Date: 2020-07-20
• Subjects: degree sequence -- mixing time -- sampling -- switch Markov chain; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20949
• Languages: English
• ISSNs: 1042-9832

Abstract

Abstract : The switch Markov chain has been extensively studied as the most natural Markov chain Monte Carlo approach for sampling graphs with prescribed degree sequences. We show that the switch chain for sampling simple undirected graphs with a given degree sequence is rapidly mixing when the degree sequence is so‐called strongly stable. Strong stability is satisfied by all degree sequences for which the switch chain was known to be rapidly mixing based on Sinclair's multicommodity flow method up until a recent manuscript of Erdős and coworkers in 2019. Our approach relies on an embedding argument, involving a Markov chain defined by Jerrum and Sinclair in 1990. This results in a much shorter proof that unifies (almost) all the rapid mixing results for the switch chain in the literature, and extends them up to sharp characterizations of P‐stable degree sequences. In particular, our work resolves an open problem posed by Greenhill and Sfragara in 2017.