Betweennesscentrale
Betweenness-centrality is a measure used in network analysis to identify the most important nodes in a graph. It quantifies the number of times a node acts as a bridge along the shortest path between two other nodes. In other words, it calculates how often a node lies on the shortest path between any two other nodes in the network. Nodes with high betweenness-centrality scores are often considered critical because they play a vital role in connecting different parts of the network. This measure is widely used in various fields such as sociology, biology, and computer science to understand the structure and function of complex networks.
The concept of betweenness-centrality was first introduced by Linton C. Freeman in 1977. It is defined mathematically
Betweenness-centrality can be normalized to account for the size of the network. The normalized betweenness-centrality is
In practice, betweenness-centrality can be computed using various algorithms, such as Brandes' algorithm, which efficiently calculates