Metraipolis › archive › dc_9c71700a1516

Hierarchical closeness — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Hierarchical_closeness
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T16:14:43.126Z
SHA-256 of the archived text
030bdc4c4b4e1514dcbf60e641d80be23d51f4f966c62a9c2d30d3a835c1bdfd
Stable URL of this page
https://metraipolis.com/documento/dc_9c71700a1516

How to cite

Hierarchical closeness — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Hierarchical_closeness (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_9c71700a1516 (Metraipolis archive dc_9c71700a1516, sha256 030bdc4c4b4e1514dcbf60e641d80be23d51f4f966c62a9c2d30d3a835c1bdfd)
BibTeX
@misc{dc9c71700a1516,
  title = {Hierarchical closeness — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Hierarchical_closeness},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_9c71700a1516; sha256 030bdc4c4b4e1514dcbf60e641d80be23d51f4f966c62a9c2d30d3a835c1bdfd},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Hierarchical_closeness. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Hierarchical closeness (HC) is a structural centrality measure used in network theory or graph theory. It is extended from closeness centrality to rank how centrally located a node is in a directed network. While the original closeness centrality of a directed network considers the most important node to be that with the least total distance from all other nodes, hierarchical closeness evaluates the most important node as the one which reaches the most nodes by the shortest paths. The hierarchical closeness explicitly includes information about the range of other nodes that can be affected by the given node. In a directed network G ( V , A ) {\displaystyle G(V,A)} where V {\displaystyle V} is the set of nodes and A {\displaystyle A} is the set of interactions, hierarchical closeness of a node i {\displaystyle i} ∈ V {\displaystyle V} called C h c ( i ) {\displaystyle C_{hc}(i)} was proposed by Tran and Kwon as follows: C h c ( i ) = N R ( i ) + C ( c l o − i ) ( i ) {\displaystyle C_{hc}(i)=N_{R}(i)+C_{(clo-i)}(i)} where: N R ( i ) ∈ [ 0 , | V | − 1 ] {\displaystyle N_{R}(i)\in [0,|V|-1]} is the reachability of a node i {\displaystyle i} defined by N R ( i ) = | { j ∈ V : ∃ {\displaystyle N_{R}(i)=|\{j\in V:\exists } a path from i {\displaystyle i} to j } | {\displaystyle j\}|} , and C c l o ( i ) {\displaystyle C_{clo}(i)} is the normalized form of original closeness (Sabidussi, 1966). It can use a variant definition of closeness as follows: C c l o − i ( i ) = 1 | V | − 1 ∑ j ∈ V ∖ { i } 1 d ( i , j ) {\displaystyle C_{clo-i}(i)={\frac {1}{|V|-1}}\sum _{j\in V\setminus \{i\}}{\frac {1}{d(i,j)}}} where d ( i , j ) {\displaystyle d(i,j)} is the distance of the shortest path, if any, from i {\displaystyle i} to j {\displaystyle j} ; otherwise, d ( i , j ) {\displaystyle d(i,j)} is specified as an infinite value. In the formula, N R ( i ) {\displaystyle N_{R}(i)} represents the number of nodes in V {\displaystyle V} that can be reachable from i {\displaystyle i} . It can also represent the hierarchical position of a node in a directed network. It notes that if N R ( i ) = 0 {\displaystyle N_{R}(i)=0} , then C h c ( i ) = 0 {\displaystyle C_{hc}(i)=0} because C ( c l o − i ) ( i ) {\displaystyle C_{(clo-i)}(i)} is 0 {\displaystyle 0} . In cases where N R ( i ) > 0 {\displaystyle N_{R}(i)>0} , the reachability is a dominant factor because N R ( i ) ≥ 1 {\displaystyle N_{R}(i)\geq 1} but C ( c l o − i ) ( i ) < 1 {\displaystyle C_{(clo-i)}(i)<1} . In other words, the first term indicates the level of the global hierarchy and the second term presents the level of the local centrality.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Graph theory»).
Fonte: Wikipedia in inglese, voce «Hierarchical closeness» — https://en.wikipedia.org/wiki/Hierarchical_closeness
Wikidata Q18207769 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q18207769
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Hierarchical_closeness?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1250833639, consultata il 2026-10-15T15:42:06.547Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 70353a922f1fb22600521d7784ea6d2026b6c56db207ca14b2e5d2a00df9af71