# Sampling graphs with a given degree sequence

# Sampling graphs with a given degree sequence

## Publications

### The mixing time of the swap (switch) Markov chains: a unified approach

We show that the swap Markov chain is rapidly mixing on $P$-stable degree sequences of simple, bipartite, and directed graphs. …

### Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs

Since 1997 a considerable effort has been spent on the study of the

**swap**(switch) Markov chains on graphic degree sequences. All of …## Talks

### A non-stable bipartite degree sequence on which the swap Markov chain is rapidly mixing

The swap Markov chain on a bipartite degree sequence $d$ operates on realizations of $d$ by taking two-two vertices from each color …