Compute closeness centralities:

Highlight:

Rank vertices. Highest-ranked vertices are at a short average distance to every other vertex:

ClosenessCentrality works with undirected graphs:

Directed graphs:

Weighted graphs:

Multigraphs:

Mixed graphs:

Use rules to specify the graph:

ClosenessCentrality works with large graphs:

Rank vertices by their relative closeness to other vertices:

Highlight the closeness centrality for CycleGraph:

GridGraph:

CompleteKaryTree:

PathGraph:

A computer ad hoc network can be modeled with a SpatialGraphDistribution. Find computers that can facilitate the quick spread of viruses in an infected network:

Critical computers:

Find the top 10 proteins that are most likely to be essential proteins in a protein interaction network of yeast:

In a regulatory network, genes are connected if there is a transcriptional regulatory intersection between them. Find the genes that are most likely to be global regulators:

A directed network that describes the flow of information among 10 organizations concerned with social welfare issues in one midwestern US city. Find the organization that can most efficiently communicate with every other organization:

A road network linking Chicago suburbs. Find the best location for hospitals and fire departments to minimize the distance traveled by emergency vehicles:

A power grid network representing the topology of the Western States Power Grid of the United States. Show that the closeness centrality follows a normal distribution:

Obtain the maximum likelihood parameter estimates, assuming a normal distribution:

Visually compare the PDFs for the original and estimated distributions:

For graphs with vertices, the largest sum in differences in closeness centrality between the most central vertex and all other vertices is the inverse of :

Measure how central the most central vertex is with respect to other vertices:

Centralization of social networks:

ClosenessCentrality is the inverse of the average distances to other reachable vertices:

The inverse of maximum distances to other reachable vertices:

Closeness centrality is between 0 and 1:

Closeness centralities for an undirected graph are equivalent to centralities for each component:

Computing the centralities for each component yields the same result:

Use VertexIndex to obtain the centrality of a specific vertex: