[Top][All Lists]

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

Re: [igraph] Centralization

From: Gábor Csárdi
Subject: Re: [igraph] Centralization
Date: Thu, 30 Oct 2008 17:58:34 +0100

Simone, it is not included in igraph, but it is not hard to do it,
only,  you need to calculate the theoretical maximum of the vertex
level centrality score "by hand". But this is easy for degree, it is
basically vcount()-1 if you don't allow loop edges.

See  http://lists.gnu.org/archive/html/igraph-help/2008-06/msg00043.html
for more info.

Tell us if you need more info...


On Thu, Oct 30, 2008 at 5:51 PM, Simone Gabbriellini
<address@hidden> wrote:
> Hi List,
> is there a function in igraph to calculate graph centralization -
> based on degree or betweenness or closeness?
> I am sure you already know those references, but I put them here anyway:
> Freeman, L.C. (1979). ``Centrality in Social Networks I: Conceptual
> Clarification.'' Social Networks, 1, 215-239.
> Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods
> and Applications. Cambridge: Cambridge University Press
> best regards,
> Simone
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     UNIL DGM

reply via email to

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