방법 비교

	가중 차수 중심성	Betweenness Centrality
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	2004	1977
창시자	Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A.	Freeman, L. C.
유형	Centrality measure for weighted networks	Centrality measure
원전	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. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
별칭	node strength, strength centrality, weighted node degree, WDC	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
관련	6	6
요약	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.	Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes.