P-stable degree sequence regions for bipartite and directed graphs
The switch Markov chain is a natural method for sampling graph realizations with a prescribed degree sequence, and $P$-stability is a general sufficient condition for its rapid mixing. Since $P$-stability is often difficult to verify directly, we develop an approach based on the simpler and more readily verifiable prop...