Directed Closeness Centrality
Directed closeness centrality extends the classical closeness measure to directed networks by separately quantifying how quickly a node can be reached by others (in-closeness) and how quickly it can reach all others (out-closeness). It is a foundational node-level metric in social network analysis and graph theory, used wherever link direction conveys meaningful asymmetry such as citation flows, information cascades, or authority hierarchies.
手法の全文を読む
無料アカウントでログインすると、このセクションを読めます。
Method map
The neighbourhood of related methods — select a node to explore.
出典
- Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38269-4
- Freeman, L. C. (1979). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215–239. DOI: 10.1016/0378-8733(78)90021-7 ↗
このページの引用方法
ScholarGate. (2026, June 3). Directed Closeness Centrality (In-closeness and Out-closeness on Directed Graphs). ScholarGate. https://scholargate.app/ja/network-analysis/directed-closeness-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 近接中心性ネットワーク分析↔ compare
- 有向介数中心性ネットワーク分析↔ compare
- 指向性固有ベクトル中心性ネットワーク分析↔ compare
- Directed PageRankネットワーク分析↔ compare
- 指向性ソーシャルネットワーク分析ネットワーク分析↔ compare