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

	সময়ভিত্তিক আইগেনভেক্টর কেন্দ্রিকতা	টেম্পোরাল ডিগ্রি সেন্ট্রালিটি
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2011-2017	2011–2012
প্রবর্তক	Grindrod, P.; Higham, D. J.; Taylor, D. et al.	Holme, P.; Saramaki, J.; Kim, H.; Anderson, R.
ধরন	Centrality measure for temporal networks	Centrality measure (temporal extension)
মৌলিক উৎস	Grindrod, P., Parsons, M. C., Higham, D. J., & Estrada, E. (2011). Communicability across evolving networks. Physical Review E, 83(4), 046120.	Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125.
অপর নাম	dynamic eigenvector centrality, time-varying eigenvector centrality, TEC, temporal communicability centrality	time-varying degree centrality, dynamic degree centrality, temporal node degree, TDC
সম্পর্কিত	5	6
সারসংক্ষেপ	Temporal eigenvector centrality extends the classical eigenvector centrality to networks that change over time. By accounting for the ordering and timing of connections, it identifies nodes that are influential not merely because of many simultaneous connections, but because they sit at the crossroads of sequentially important pathways across multiple time slices of the network.	Temporal degree centrality extends the classic degree centrality to time-varying networks by counting how many distinct contacts a node accumulates over time. Rather than collapsing a dynamic network into a single static graph, it preserves the temporal order of edges, yielding a more faithful measure of a node's activity and reachability across the observation window.