[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] calculating information centrality in igraph
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] calculating information centrality in igraph |
Date: |
Sun, 8 Mar 2009 20:47:58 +0100 |
Hu Ruy,
try using the 'Matrix' package and the 'sparse=TRUE' option of 'get.adjacency'.
G.
On Sun, Mar 8, 2009 at 8:38 PM, Ruy Cervantes <address@hidden> wrote:
> Hi,
>
> Has anyone calculated the information centrality (Stephenson and Zelen,
> 1989) metric using igraph for a large graph?
>
> The problem that I face is that information centrality is calculated
> inverting a matrix, but my the network that I have is quite large(26,000
> nodes and 300,000 edges), and R runs out memory if I get the adjacency
> matrix from igraph.
>
> Information centrality is calculated inverting the matrix B. B = D(r) - A +
> J , where D(r) is a diagonal matrix with the degree of each node, A is the
> adjacency matrix, and J a matrix full of 1's.
>
> I am using igraph 5.1, R 2.8.1 in OS X.
>
> Any ideas?
>
> Thanks,
> Ruy Cervantes
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
--
Gabor Csardi <address@hidden> UNIL DGM