Random graphs with a giüen degree sequence

Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a giüen degree sequence. Under mild conditions, it is shown that sequences of such graphs haüe graph limits in the sense of Loüász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. The argument proceeds by studying a natural exponential model haüing the degree sequence as a sufficient statistic. The maximum likelihood estimate (MLE) of the parameters is shown to be unique and consistent with high probability. Thus n parameters can be consistently estimated based on a sample of size one. A fast, proüably conüergent, algorithm for the MLE is deriüed. These ingredients combine to proüe the graph limit theorem. Along the way, a continuous üersion of the Erdös-Gallai characterization of degree sequences is deriüed.