השוואת שיטות

	מרכזיות דרגה	מרכזיות דרגה משוקללת
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Machine learning	Machine learning
שנת המקור	1978	2004
הוגה השיטה	Freeman, L. C.	Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A.
סוג	Node-level centrality measure	Centrality measure for weighted networks
מקור מכונן	Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.	Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752.
כינויים	node degree, degree score, DC, connectivity centrality	node strength, strength centrality, weighted node degree, WDC
קשורות	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.	Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score.