เปรียบเทียบวิธี

	แบบจำลองการแพร่กระจายในเครือข่าย	การวิเคราะห์ความเป็นศูนย์กลาง	การวิเคราะห์ความยืดหยุ่นและความเปราะบางของเครือข่าย
สาขาวิชา	การวิเคราะห์เครือข่าย	การวิเคราะห์เครือข่าย	การวิเคราะห์เครือข่าย
ตระกูล	Process / pipeline	Process / pipeline	Process / pipeline
ปีกำเนิด	1927 (epidemiological compartmental); 2003 (social influence cascade)	1979	2000
ผู้ริเริ่ม	Kermack & McKendrick (SIR/SIS, 1927); Kempe, Kleinberg & Tardos (Independent Cascade, 2003)	Linton C. Freeman	Albert, Jeong & Barabási
ประเภท	Stochastic / deterministic simulation on graphs	Descriptive / exploratory network measure family	Network robustness / vulnerability framework
แหล่งต้นตำรับ	Kermack, W.O. & McKendrick, A.G. (1927). A Contribution to the Mathematical Theory of Epidemics. Proceedings of the Royal Society of London. Series A, 115(772), 700-721.	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.	Albert, R., Jeong, H. & Barabási, A.L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–382.
ชื่อเรียกอื่น	epidemic spreading models, compartmental models, influence propagation models, Ağ Yayılım Modelleri (SIR, SIS, Independent Cascade)	Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality	network vulnerability analysis, attack tolerance analysis, Ağ Dayanıklılığı ve Güvenlik Açığı Analizi
ที่เกี่ยวข้อง	5	5	5
สรุป	Network diffusion models are a family of compartmental and probabilistic frameworks that simulate how information, disease, or innovation spreads across a connected system. Rooted in the mathematical epidemiology of Kermack and McKendrick (1927), the SIR and SIS models partition nodes into states and track transitions driven by contact rates and recovery probabilities. The Independent Cascade and Linear Threshold models, formalised by Kempe, Kleinberg, and Tardos (2003), extend this logic to social influence, modelling how activation propagates through a network one neighbour at a time.	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.	Network resilience and vulnerability analysis is an analytical framework, formalised by Albert, Jeong, and Barabási (2000), that measures how a network degrades functionally as nodes or edges are progressively removed. By running targeted-attack simulations — removing the highest-centrality nodes first — and random-failure simulations — removing nodes at uniform probability — the framework identifies which structural elements are critical to network integrity and where infrastructure is most exposed.