השוואת שיטות

	מרכזיות דרגה	מרכזיות קרבה
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Machine learning	Machine learning
שנת המקור	1978	1950 (formalized 1979)
הוגה השיטה	Freeman, L. C.	Bavelas, A.; formalized by Freeman, L. C.
סוג	Node-level centrality measure	Node-level centrality index
מקור מכונן	Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.	Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.
כינויים	node degree, degree score, DC, connectivity centrality	closeness, farness-based centrality, geodesic closeness, normalized closeness centrality
קשורות	6	6
תקציר	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.	Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts.