방법 비교

	중심성 척도	고유벡터 중심성
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	1978	1972
창시자	Freeman, L. C.	Bonacich, P.
유형	Node-level centrality measure	Centrality measure
원전	Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.	Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120.
별칭	node degree, degree score, DC, connectivity centrality	eigenvector centrality, EC, Bonacich centrality, power 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.	Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network.