[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] betweeness centrality
|
From: |
Gábor Csárdi |
|
Subject: |
Re: [igraph] betweeness centrality |
|
Date: |
Tue, 26 Nov 2013 09:16:53 -0500 |
On Tue, Nov 26, 2013 at 9:12 AM, Matthew Galati
<address@hidden> wrote:
>
>> I guess you are right. I just took the formula from Freeman's classic
>> paper, and never realized that it only works for undirected graphs,
>> for directed graphs you need to halve that, because there are twice as
>> many shortest paths, right?
>
>
> Yes. I think the normalization should be 1/((n-1)(n-2)). And, for
> undirected, if you double count (which you probably do), then you need the
> 2.
It's not because of the double-counting, it's because for undirected
you divide by (n-1)(n-2)/2. Anyway, I'll fix this ASAP.
G.
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>