[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] Re: betweenness and degree correlation

From: Tamas Nepusz
Subject: [igraph] Re: betweenness and degree correlation
Date: Tue, 23 Jun 2009 17:03:14 +0100
User-agent: Mutt/1.5.17 (2007-11-01)

Hi Yong,

> For the betweenness centrality, it seems very easy to have overflow
> now for my other network. Please have a look at my attachment (edge
> list), which has only 1000 nodes. But I really want to analyze the BC
> for this network.
The betweenness calculation seems fine for me for this network; i.e.,
the maximum betweenness is 3641.928 and the minimum is zero. What are
your results?

> Another problem is about the degree-degree correlation, namely, I want
> to calculate something P(k'|k) which is so called assortativity
> coefficient. But I'm sorry I couldn't find it somewhere from igraph.
This is not implemented directly in igraph, but it's fairly simple (at
least if you are thinking about the assortativity coefficient as defined
by Newman). This is calculated in Python as follows:


I guess it's not too complicated to translate this back to C.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]