Re: [igraph] about degree.sequence.game and configuration model

[Gábor Csárdi]

Hi,

from the documentation of that function:

     The “simple” method connects the out-stubs of the edges
     (undirected graphs) or the out-stubs and in-stubs (directed
     graphs) together. This way loop edges and also multiple edges may
     be generated.

     This method is not adequate if one needs to generate simple graphs
     with a given degree sequence. The multiple and loop edges can be
     deleted, but then the degree sequence is distorted and there is
     nothing to ensure that the graphs are sampled uniformly.

     THe “vl” method is a more sophisticated generator. The algorithm
     and the implementation was done by Fabien Viger and Matthieu
     Latapy. This generator always generates undirected, connected
     simple graphs, it is an error to pass the ‘in.deg’ argument to it.
     The algorithm relies on first creating an initial (possibly
     unconnected) simple undirected graph with the given degree
     sequence (if this is possible at all). Then some rewiring is done
     to make the graph connected. Finally a Monte-Carlo algorithm is
     used to randomize the graph. The “vl” samples from the undirected,
     connected simple graphs unformly. See <URL:
     http://www-rp.lip6.fr/~latapy/FV/generation.html> for details.

The "vl" method might be equivalent to the configuration model,
depending on whether that allows unconnected graphs or not.

Best,
Gabor

On Tue, Sep 21, 2010 at 2:55 PM, gunce orman <address@hidden> wrote:
> hi,
>
> I would like to ask if the degree.sequence.game() function generates
> networks as same as  configuration model??  You do not give any
> configuration model reference on the web page og this function. Do the
> networks which are generated by this function have the same properties with
> configuration model generated networks?
>
> thank you
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM