Important Paper on Seussian Configurations of Random-Graph Models

In network science, it is with very good reason that one should speak of "a" configuration model rather than "the" configuration model. To see an excellent discussion of this and related issues, be sure to go through this paper by Bailey Fosdick, Daniel Larremore, Joel Nishimura, and Johan Ugander.

Title: Configuring Random Graph Models with Fixed Degree Sequences

Authors: Bailey K. Fosdick, Daniel B. Larremore, Joel Nishimura, and Johan Ugander


In 2014, Aaron Clauset, David Kempe, and I (with help from Dan Larremore) organized a Mathematics Research Community in Network Science.

In addition to creating a network of network scientists from diverse backgrounds, some work was started there, and today the published version of what is in my opinion an extremely important paper has come out in final form in SIAM Review's 'Research Spotlights' section. I am, of course, talking about the aforementioned paper.

I'm very happy indeed for such excellent work to arise from this.

Congratulations to authors Bailey Fosdick, Daniel Larremore, Joel Nishimura, and Johan Ugander for creating this awesome paper!

I am posting this with an absolutely lovely Seussian picture from an arXiv version of the paper. This picture doesn't appear to have made the cut for the published piece. In addition to its wit and whimsy, a really great thing about the picture and its accompanying verse is that it also encodes the main message of the paper.

Note: I am on the editorial board of the Research Spotlights section of SIAM Review, but I had nothing whatsoever to do with the handling of this paper.