Salīdzināt metodes

	Svērtais pakāpes centralitāte	Centrālā pakāpe
Nozare	Tīklu analīze	Tīklu analīze
Saime	Machine learning	Machine learning
Izcelsmes gads	2004	1978
Autors	Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A.	Freeman, L. C.
Tips	Centrality measure for weighted networks	Node-level centrality measure
Pirmavots	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.	Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.
Citi nosaukumi	node strength, strength centrality, weighted node degree, WDC	node degree, degree score, DC, connectivity centrality
Saistītās	6	6
Kopsavilkums	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.	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.