Calculating Node Betweenness Centrality and Edge Betweenness Centrality in Complex Networks

In complex network analysis, betweenness centrality is a metric that measures the importance of nodes or edges within a network. It primarily reflects the frequency at which a node or edge appears in all shortest paths. Calculating betweenness centrality helps identify critical hubs or key connections in networks.

### 1. Node Betweenness Centrality Node betweenness centrality is defined as the number of times a node is traversed by all shortest paths between node pairs. Implementation typically involves: First, computing all-pairs shortest paths using Breadth-First Search (BFS) for unweighted graphs or Dijkstra's algorithm for weighted graphs. Then, counting how many shortest paths pass through each node. Optionally normalize the results by dividing by the total number of possible node pairs ((n-1)(n-2)/2 for undirected graphs), scaling values between [0,1].

Nodes with higher betweenness centrality act as important intermediaries and may represent critical network hubs.

### 2. Edge Betweenness Centrality Edge betweenness centrality similarly measures an edge's frequency in all shortest paths. The computational procedure includes: Computing all shortest paths between node pairs using BFS or Dijkstra's algorithm. Counting how many shortest paths utilize each edge. Normalization can be applied for comparison across networks of different sizes.

Edges with high betweenness centrality are typically critical connections whose removal may significantly impact network connectivity.

### Application Scenarios Betweenness centrality has broad applications in network analysis, such as: Transportation networks: Identifying critical intersections or main arteries. Communication networks: Locating nodes or links prone to bottlenecks. Social networks: Discovering key influencers or relationships in information diffusion.

By calculating betweenness centrality, we can better understand network structural properties and optimize network robustness and efficiency.