Harmonic centrality · answer
What Is Harmonic Centrality?
Harmonic centrality measures how close a node is to the other nodes it can reach in a network. In a web graph, a node may represent a domain and a directed edge represents a link from one domain to another.
For a domain v, the score adds the reciprocal of the shortest path distance to each reachable domain u. A direct link contributes more than a longer path. A domain that cannot be reached contributes zero.
HC(v) = Σu ≠ v 1 / d(v, u)
That makes harmonic centrality a measure of reachability and closeness. Read how the formula is calculated and what the score and rank mean.
This answer describes the metric used by the HarmonicCentrality.org calculator. Common Crawl’s graph releases and methods can change; check the release shown with each score.