Relative Betweenness

Asked by Matthias on 2010-10-06

Hi all,

  I'm a bit confused about the calculation of the relative betweennness. As far as I see in the source code, the betweenness is normalized by (n-1)(n-2)/2 for directed and (n-1)(n-2) for undirected graphs:

--snip-- //GraphDistance.java
            if (!mDirected) {
                mBetweenness[s_index] /= 2;
            }
            if (this.mRelativeValues) {
                mCloseness[s_index] = 1.0 / mCloseness[s_index];
                mBetweenness[s_index] /= ((mN - 1) * (mN - 2)) / 2;
            }
--snap--

  However, this is not correct and should be directly opposed. The betweenness for directed graphs is normalized by (n-1)(n-2) and for undirected graphs by (n-1)(n-2)/2.

  Is there something I missed?

Thanks
  matthias

Question information

Language:
English Edit question
Status:
Answered
For:
Gephi Edit question
Assignee:
pjmcswee Edit question
Last query:
2010-10-06
Last reply:
2011-02-10

Thanks for pointing that, it will be fixed in the next update.

Can you help with this problem?

Provide an answer of your own, or ask Matthias for more information if necessary.

To post a message you must log in.