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?
Thanks for the report, and for the patience! Best, Gabor On Mon, Nov 25, 2013 at 4:58 PM, Matthew Galati <[email protected]> wrote: >> Actually, the normalization is not by (n-1)(n-2), but Bnorm = >> 2*B/(n*n-3*n+2), and the results seem to be correct according to this. > > > Why 2*B? Shouldn't the normalized value be in [0,1]? > > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
