[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Betweennes centrality (maximum and normalization)
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] Betweennes centrality (maximum and normalization) |
Date: |
Wed, 10 Feb 2010 17:12:39 +0100 |
Stefan, I am not sure that I understand your questions correctly, but
I think Freeman's paper might answer them:
Centrality in social networks conceptual clarification
Linton C. Freeman
Social Networks, 1979
Gabor
ps. google for it to get a PDF if you don't have sciencedirect access
On Wed, Feb 10, 2010 at 5:05 PM, Stefan Kroeger <address@hidden> wrote:
> Hi,
>
> I hope it's okay to ask a pretty special question to betweenes
> centrality (BC) and not directly related to igraph.
>
> (mention: I deal with the node-related BC in undirected graphs.)
>
> my two problems/questions are:
> (i) Is the highest measure BC of network, also the theoretical hightest
> reachable (maximum) BC for the graph?
>
> (ii) Is there a way to normalize the betweennes centrality measures to
> be able to compare between different graph?
>
>
> thanks a lot
> Stefan
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
--
Gabor Csardi <address@hidden> UNIL DGM