Random Graphs with a Given Degree Sequence 4: A Continuum Erdős–Gallai Condition Characterizes the Interior of the Set of Degree-Sequence Scaling LimitsResearch Paper
A uniformly random simple graph with a prescribed degree sequence is a basic null model in network science, statistics and combinatorics: it is what a network "looks like" when nothing but its degrees is known. Chatterjee, Diaconis and Sly (arXiv:1005.1136, Ann. Appl. Probab. 2011) show that when the normalized degree sequences converge to a limiting…