[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Generating a network with a given degree list
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] Generating a network with a given degree list |
Date: |
Wed, 8 Dec 2010 13:56:03 +0100 |
degree.sequence.game(deg_list, method="vl")
is actually better. It generates simpel graphs and samples uniformly.
Gabor
On Wed, Dec 8, 2010 at 1:22 PM, harun pirim <address@hidden> wrote:
> You may try g <- degree.sequence.game(deg_list)
>
> Then you can simplify(g)
>
> However this method requires total degree should be even.
>
> Harun
>
> On 12/8/10 5:17 AM, "Lorenzo Isella" <address@hidden> wrote:
>
>>deg_list<-c(4,1,2,3,3,1,1,1,1)
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
--
Gabor Csardi <address@hidden> UNIL DGM