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 Sfragara published a breakthrough paper about irregular norm...

Full description

Bibliographic Details
Main Authors: Péter L Erdős, Tamás Róbert Mezei, István Miklós, Dániel Soltész
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2018-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC6089458?pdf=render