Sampling graphs with a given degree sequence

Avatar
Tamás Róbert Mezei
Mathematician

My research interests include Graph Theory, Computational Geometry, and Algorithms

Publications

We show that the swap Markov chain is rapidly mixing on $P$-stable degree sequences of simple, 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

The aim of this paper is to confirm that $P$-stability of a family of unconstrained/bipartite/directed degree sequences is sufficient …

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