পদ্ধতির তুলনা করুন

	ডিগ্রি সেন্ট্রালিটি	আইগেনভেক্টর সেন্ট্রালিটি
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	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.