Closeness Centrality
A network analysis metric that measures how efficiently a node can reach all other nodes in a network through the shortest paths.
Closeness Centrality
Closeness centrality is a fundamental metric in network analysis that quantifies how "close" a node is to all other nodes in a network. It measures the average length of the shortest paths between a node and all other nodes, providing insight into which nodes can most efficiently spread information or influence throughout the network.
Mathematical Definition
The closeness centrality of a node is calculated as:
C(v) = (n-1) / Σ d(v,u)
Where:
- n is the number of nodes in the network
- d(v,u) is the shortest path distance between nodes v and u
- Σ represents the sum of all shortest paths from v to other nodes
Applications
Social Network Analysis
In social networks, closeness centrality helps identify:
- Key influencers who can rapidly spread information
- Central figures in communication networks
- opinion leaders who can efficiently reach others
Transportation Networks
Applied to transportation systems, closeness centrality reveals:
- Optimal locations for facilities
- Critical infrastructure nodes
- urban planning considerations for accessibility
Information Flow
In information networks, high closeness centrality indicates:
- Efficient data distribution points
- Strategic communication hubs
- network bottlenecks that may affect information spread
Comparison with Other Centrality Measures
While related to other centrality metrics, closeness centrality differs from:
- betweenness centrality - focuses on bridge nodes
- degree centrality - measures direct connections only
- eigenvector centrality - considers connection quality
Limitations
Several factors can affect the reliability of closeness centrality:
- Disconnected components in the network
- Network size and density
- temporal networks where connections change over time
Implementation
Common tools for calculating closeness centrality include:
- NetworkX (Python)
- igraph (R/Python)
- Gephi (visualization software)
Best Practices
When using closeness centrality:
- Consider network completeness
- Normalize for network size
- Compare with other centrality measures
- Account for network context
Future Directions
Emerging research areas include:
- Dynamic closeness centrality in evolving networks
- weighted networks applications
- Integration with machine learning algorithms