Machine learningNetwork science
Degree Centrality
Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI: 10.1016/0378-8733(78)90021-7 ↗
- Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
Related methods
Referenced by
Betweenness CentralityCloseness CentralityDirected PageRankDirected Social Network AnalysisDynamic Degree CentralityDynamic PageRankEigenvector CentralityMultilayer Degree CentralitySocial Network AnalysisTemporal Degree CentralityWeighted Degree CentralityWeighted Ego Network AnalysisWeighted Eigenvector CentralityWeighted PageRankWeighted Social Network Analysis