One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using __swaps__. The swap Markov chain converges to the uniform distribution, but generally it is not known …
We show that the switch Markov chain is rapidly mixing on $P$-stable degree sequences of simple, bipartite, and directed graphs. Consequently, we have rapid mixing on power-law distribution-bounded degree sequences with parameter $\gamma2$ and on …
Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three universality classes, the most studied being the 'critical' one. For this class the scaling of the quantity of …