방법 비교

	시간적 차수 중심성	Temporal PageRank
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	2011–2012	2016
창시자	Holme, P.; Saramaki, J.; Kim, H.; Anderson, R.	Rozenshtein, P. & Gionis, A.
유형	Centrality measure (temporal extension)	Centrality / ranking algorithm for temporal networks
원전	Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125.	Rozenshtein, P. & Gionis, A. (2016). Temporal PageRank. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Part II, LNCS 9852, pp. 674–689. Springer.
별칭	time-varying degree centrality, dynamic degree centrality, temporal node degree, TDC	TPR, time-aware PageRank, streaming PageRank, dynamic PageRank
관련	6	6
요약	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.	Temporal PageRank extends the classic PageRank algorithm to time-evolving networks by incorporating the recency and ordering of interactions. Edges are weighted by a decay function so that recent contacts contribute more to a node's score than old ones. The result is a dynamic importance ranking that captures who is influential right now, rather than over the entire history of the network.