When working with computer systems, you may need to find the most important nodes in the network. Closeness centrality helps. Learn more about closeness centrality, including how it’s calculated and real-world examples.

Closeness centrality is a measure in network analysis that quantifies how close a node is to all other nodes in a network.
The closeness centrality calculation is the inverse of the sum of the shortest path lengths between that node and all other nodes in the network.
Closeness centrality identifies nodes that are important for efficient communication and information flow in a network.
You can use this measure as a network engineer, network architect, network operations analyst, or telecommunication specialist as part of your network analytics responsibilities.
Learn how to use closeness centrality to identify the most important nodes in your networks to improve information delivery and maximize network efficiency. You can also begin learning network engineering fundamentals with the Akamai Network Engineering Professional Certificate. In as little as three months, master up-to-date practical skills and knowledge that network operation engineers use in their daily roles. By the end of the five-course series, you’ll have had the opportunity to implement networking technologies such as TCP/IP and DNS, build basic SQL commands, and write scripts to manage security incidents.
The idea that a node that is closer to all other nodes can more easily access and influence information in the network is what closeness centrality relates to. The closeness centrality of a node calculation is the inverse of the sum of the shortest path lengths between that node and all other nodes in the network. Essentially, it measures how quickly a node can reach all other nodes in the network and how quickly information can spread through the network as a result.
Since closeness centrality is a common measure utilized in network analysis, you will likely use this concept in network analytic roles. Individuals in network analyst roles often look to deploy the algorithm in cases where finding the most efficient or optimal path in a system is necessary.
Telecommunication specialists looking to determine when information delivery will occur across a network may use closeness centrality to provide an estimate. Similarly, analysts of social networks can leverage closeness centrality to assess relationships between different people in a network and track how information is disseminated.
Network analysts play a crucial role in organizations across many industries by working to maximize the overall efficiency of network operations. As part of the IT team at their company, network analysts work hands-on with computer hardware and software and often serve as the individuals responsible for supporting and handling technical issues. Four common network analyst jobs in the workforce today are:
Network engineer: Similar to a network administrator, network engineers play a key role in building and maintaining a company’s IT system. They focus on designing systems that perform optimally and also focus on configuration, maintenance, and security within the system.
Network architect: Network architects focus on communication networks, leveraging their technical abilities to maintain and properly utilize the systems. They bridge the gap between software and hardware to promote network design, modeling, and security.
Network operations analyst: As part of the operations team within an IT department, network operations analysts work with various technical teams across an organization to handle any issues happening with the network system. They monitor, troubleshoot, and give technical support to resolve issues.
Telecommunication specialist: Within communication systems, telecommunication specialists manage, build, and monitor overall performance, including finding new ways to improve the system’s capabilities. They look to promote efficient interaction across all computers and devices included in the broader communication system.
Read more: 4 Types of Neural Network Architecture
Closeness centrality identifies nodes that are important for efficient communication and information flow in a network. Some examples of closeness centrality include:
Communication network: Closeness centrality identifies where the most important nodes for information dissemination are, such as websites or social media accounts that can quickly reach many people.
Biological network: Closeness centrality identifies biological structures that play the most important roles in certain biological processes, such as pivotal genes, metabolites, or protein structures.
Transportation network: Closeness centrality identifies exactly where the most central transportation hubs or stations are most easily accessible to all other locations in the network.
To calculate closeness centrality for a node, you first find the shortest path between that node and all other nodes in the network. Divide the sum of these distances by the total number of nodes in the network minus one (to account for the fact that the node itself is not included in the sum). The resulting score is the closeness centrality of the node.
Harmonic centrality relates to closeness centrality and deals with unconnected nodes in a graph. Beauchamp introduced a new formula in 1965, where inaccessible distances become infinite by being zeroed out in the calculation [1,2]. An alternative way to look at this issue regarding closeness centrality came about almost 30 years later. In 1994, Wasser and Faust introduced a new and improved formula for closeness centrality to address any number of unconnected nodes present in a graph network [2,3].
Betweenness centrality is a measure in network analysis that identifies nodes with high communication flow and control over information flow. Betweenness centrality and the calculation of it does not have a standardized form. Various methods of calculation are sufficient in discovering betweenness. A basic example of the calculation is to take every network pair and count how often a shortest path between two nodes crosses this path. It measures how often a node occurs on all shortest paths between two nodes, and its value relates to the total number of shortest paths linking those two nodes.
Betweenness centrality calculates how much a given node is on the quickest path in between the other nodes. On the contrary, closeness centrality measures the closeness of a given node in comparison to all other nodes that exist in the network. Betweenness centrality is a measure of the node’s importance for maintaining the connectivity of the network, while closeness centrality is a measure of how quickly information can spread through the network. Nodes with high betweenness centrality often become important for preventing network fragmentation, while nodes with high closeness centrality are important for information dissemination and efficient communication.
The four types of centrality are degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Degree centrality refers to the number of direct connections a node has, while betweenness centrality counts how many times a particular node bridges the shortest path between two other nodes. Closeness centrality is the average distance from one node to all other network nodes, and eigenvector centrality provides a relative score that takes both quantity and quality of connections into account.
Explore industry trends and in-demand network analysis career pathways by subscribing to our LinkedIn newsletter, Career Chat. Then, explore these resources to build relevant skills, find your next career step, and learn from others’ experiences:
Watch on YouTube: Exploring IT Career Paths: Your Guide to a Rewarding Tech Future
Learn new trends: How AI is transforming IT
Take your next step: What should you earn: a certificate or a degree?
Whether you want to develop a new skill, get comfortable with an in-demand technology, or advance your abilities, keep growing with a Coursera Plus subscription. You’ll get access to over 10,000 flexible courses.
Wiley Online Library. “An improved index of centrality, https://onlinelibrary.wiley.com/doi/10.1002/bs.3830100205.” Accessed November 21, 2025.
Graphable. “When is the Closeness Centrality Algorithm best applied?, https://graphable.ai/blog/closeness-centrality-algorithm.” Accessed November 21, 2025.
ASECIB. “Social Network Analysis, https://www.asecib.ase.ro/mps/Social%20Network%20Analysis%20%5B1994%5D.pdf.” Accessed November 21, 2025.
Editorial Team
Coursera’s editorial team is comprised of highly experienced professional editors, writers, and fact...
This content has been made available for informational purposes only. Learners are advised to conduct additional research to ensure that courses and other credentials pursued meet their personal, professional, and financial goals.