Creating random graphs with a given degree sequence has applications from modelling networks to counting classes of graphs. We will consider how these random graphs can be created and examine the drawbacks to the current algorithms. Then, we will see where the inherent difficulty comes from in creating these random graphs. Finally, we will introduce a new approach that overcomes many of these problems.
Brian Cloteaux is a computer scientist in the Computing and Communications Theory Group of the Information Technology Laboratory at the National Institute of Standards and Technology in Gaithersburg, Maryland. He holds a Ph.D. degree in Computer Science from New Mexico State University. Previously, he has worked at ExxonMobil in both computing and research