Mental model
Closeness Centrality
A measure of how quickly information can spread through a network by calculating average distance to all other nodes.
Discover
In a company of 20 employees, who can reach everyone fastest?
Pick the most connected employee
You'll learn why reachability matters more than position.
Understand
Understand
Closeness centrality measures how quickly someone can reach everyone else in a network, like an IT manager who helps all departments daily with tech support. The higher your closeness centrality, the faster information or resources can flow through you to others. Notice this: Who in your workplace connects to the most different teams?
Full explanation
Full explanation
Closeness centrality calculates the average number of steps needed to reach every other person in a network. It's not about having the most direct connections—it's about being positioned to reach everyone efficiently through the shortest paths.
In a workplace, the IT manager might have higher closeness centrality than the CEO because they interact daily with every department solving problems. Similarly, in social media, a user who bridges different friend groups spreads information faster than someone with many followers in one cluster.
This metric reveals hidden influencers who aren't necessarily in formal leadership positions. In transportation networks, a central hub city with good connections to all regions demonstrates high closeness centrality, enabling rapid distribution of goods and services.
Understanding closeness centrality helps identify bottlenecks and optimize communication. When building teams, placing someone with high closeness centrality in coordination roles can improve information flow and decision-making speed across the organization.
Research
Research
Closeness centrality quantifies a node's efficiency in spreading information by measuring the inverse of the sum of shortest path distances to all other nodes. It was formalized in social network analysis to identify individuals who can quickly reach others in a network.
- Freeman (1979): Established closeness centrality as a key measure alongside degree and betweenness centrality for analyzing network structure [1]
- Sabidussi (1966): First mathematically defined closeness centrality as the reciprocal of the sum of distances from a node to all others [2]
- Bavelas (1950): Early work on communication networks identified that central positions enable faster information propagation [3]
Limitations
Limitations
Closeness centrality assumes all connections are equally valuable and ignores connection strength or direction. In disconnected networks, it becomes undefined for isolated nodes. It also doesn't account for the quality or trustworthiness of information flowing through paths, potentially overestimating influence in networks with weak ties.
Try it
Synthesize
Choose a pattern from the guide, then pick an action to try with it.
Which pattern stands out?
What will you try?
Choose a pattern above to select an action.
Sources
Sources
- [1] Centrality in Social Networks: Conceptual ClarificationLinton C. Freeman - 1979
- [2] The centrality index of a graphG. Sabidussi - 1966
- [3] Communication Patterns in Task-Oriented GroupsAlex Bavelas - 1950
- [4] Social Network Analysis: Methods and ApplicationsStanley Wasserman and Katherine Faust - 1994
Try it
Check your understanding
A project manager who works with every department weekly but has few direct reports likely has high:
Show the guide's explanation
Answer: Closeness centrality
Closeness centrality measures reachability to all nodes through short paths, not direct connections. The manager can reach everyone efficiently through weekly interactions, even with few direct reports.
In which scenario would closeness centrality be the most useful metric to identify key influencers?
Show the guide's explanation
Answer: Identifying who spreads rumors fastest in a company
Closeness centrality measures how quickly information can reach all nodes, making it ideal for identifying efficient information spreaders like rumor propagators in organizations.
True or False: A node with the most direct connections always has the highest closeness centrality.
Show the guide's explanation
Answer: False
Degree (number of connections) and closeness (efficiency of reaching all nodes) measure different things. A node with many connections clustered together may have lower closeness than a well-positioned node with fewer connections.
Keep exploring
Find another idea for the decision in front of you.
The complete Reframo library is free to read. Explore another guide whenever you are ready.