So sánh phương pháp

	Phân tích mạng thời gian	Phân tích Trung tâm
Lĩnh vực	Phân tích mạng lưới	Phân tích mạng lưới
Họ	Process / pipeline	Process / pipeline
Năm ra đời	2012	1979
Người khởi xướng	Holme & Saramäki (2012) — seminal framework	Linton C. Freeman
Loại	Dynamic graph analysis	Descriptive / exploratory network measure family
Công trình gốc	Holme, P. & Saramäki, J. (2012). Temporal Networks. Physics Reports, 519(3), 97-125.	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.
Tên gọi khác	dynamic network analysis, time-varying network analysis, Zamansal Ağ Analizi (Temporal / Dynamic Networks)	Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality
Liên quan	3	5
Tóm tắt	Temporal network analysis, formalised by Holme and Saramäki in their landmark 2012 Physics Reports survey, is the study of networks in which edges appear and disappear over time. Rather than collapsing all contacts into a single static graph, the approach preserves the precise timing of interactions — whether as contact sequences, time-stamped event lists, or windowed snapshots — and uses that timing to track how influence, disease, or information can actually propagate through the system.	Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors.