방법 비교

	Temporal PageRank	시간적 매개 중심성
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	2016	2012
창시자	Rozenshtein, P. & Gionis, A.	Kim, H. & Anderson, R.; Holme, P. & Saramäki, J.
유형	Centrality / ranking algorithm for temporal networks	Centrality measure for temporal networks
원전	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.	Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125.
별칭	TPR, time-aware PageRank, streaming PageRank, dynamic PageRank	TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness
관련	6	6
요약	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.	Temporal Betweenness Centrality (TBC) extends classical betweenness centrality to time-stamped networks by counting how often a node lies on time-respecting shortest paths — paths that traverse edges in chronological order. It identifies nodes that act as temporal brokers, controlling information or resource flow as it evolves over time, rather than in a static snapshot.