[Top][All Lists]

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

Re: [igraph] normalization of betweenness centrality

From: Matthew Walker
Subject: Re: [igraph] normalization of betweenness centrality
Date: Tue, 17 Nov 2009 08:41:02 -0500
User-agent: Thunderbird (X11/20090812)

Hi Anupam,

Freeman's paper [1] gives information on how betweenness values can be normalised. You would be specifically interested in the formula on page 224:

(2 * igraph_betweenness()) / (n*n - 3*n + 2)

where n is the number of nodes in the graph (igraph_vcount()).

I hope that helps,

[1] Linton C. Freeman. 1979. "Centrality in Social Networks Conceptual Clarification" in Social Networks 1 (1978/79). Pages 215--239.


anupam sinha wrote:
Hi all,
The betweenness centrality value generated for a specific network is not normalized (i.e. it depends on network size) if one is using the "betweenness" function of igraph. My query is how does one normalize the betweenness values for all the nodes of a directed network . Thanks in advance for any help.



reply via email to

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