Homepage of T.R. Mezei
Homepage of T.R. Mezei
Home
Projects
Publications
Talks
Experience & Contests
Posts
Contact
CV
Light
Dark
Automatic
bipartite graph
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 these results assume some kind of regularity in the corresponding degree sequences. Recently, Greenhill and …
Cite
×