This is an old revision of this page, as edited by MayAnna(talk | contribs) at 20:19, 29 November 2017(first draft - introduction). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 20:19, 29 November 2017 by MayAnna(talk | contribs)(first draft - introduction)
Degree sequence and different network realizations in the configuration model
The configuration model is a method for generating random networks from given degree sequence. It is widely used as a reference model for real-life social networks, because it allows the modeller to incorporate arbitrary degree distributions. For example, the modularity score is computed using the configuration model as a reference.
In the configuration model, the degree of each vertex is pre-defined, as opposed to having a probability distribution from which the given degree is chosen.[1]
As opposed to the Erdös-Rényi model, the degree sequence of the configuration model is not restricted to have a Poisson-distribution, the model allows the user to give the network any desired degree distribution.
