[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] degree distribution for bipartite network
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] degree distribution for bipartite network |
Date: |
Thu, 03 Feb 2011 18:05:49 +0100 |
User-agent: |
Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.2.13) Gecko/20101208 Lightning/1.0b2 Thunderbird/3.1.7 |
The trick in my previous email works with 0.6 only if I remember it
correctly; 0.5.x does not allow you to call
g.vs.select(type=0).degree(), but you can still use
g.degree(g.vs.select(type=0)).
--
T.
On 02/03/2011 05:58 PM, Simone Gabbriellini wrote:
> Hello List,
>
> how can I find the degree distribution for separate sets of nodes? In R I do
> something like:
>
> deg<-degree(g)[V(g)$type==FALSE]
> dd<-as.numeric(table(deg))/sum(as.numeric(table(deg)))
>
> Is it possible in python to find the degree distribution conditioned on a
> node's attribute value?
>
> many thanks,
> Simone
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>