Asset Details
Do you wish to reserve the book?
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE
Do you wish to request the book?
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE
2011
Overview
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lová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 having 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, provably convergent, algorithm for the MLE is derived. These ingredients combine to prove the graph limit theorem. Along the way, a continuous version of the Erdős—Gallai characterization of degree sequences is derived.
We currently cannot retrieve any items related to this title. Kindly check back at a later time.