방법 비교

	가중 네트워크 확산 분석	가중치 PageRank
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	2004	2004
창시자	Barrat, A.; Newman, M. E. J.	Xing, W. & Ghorbani, A.
유형	Network diffusion model	Centrality measure / ranking algorithm
원전	Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752.	Xing, W., & Ghorbani, A. (2004). Weighted PageRank algorithm. Proceedings of the Second Annual Conference on Communication Networks and Services Research (CNSR '04), pp. 305–314. IEEE.
별칭	WNDA, weighted diffusion process, edge-weighted spreading analysis, weighted information diffusion	WPR, weighted page rank, edge-weighted PageRank, strength-based PageRank
관련	6	6
요약	Weighted Network Diffusion Analysis models how information, influence, disease, or resources spread through a network whose edges carry quantitative strength values. By letting tie weights govern transition probabilities, the method produces more realistic spreading dynamics than binary-edge diffusion, revealing which high-traffic pathways dominate propagation in social, biological, and information networks.	Weighted PageRank extends the classic PageRank algorithm to networks where edges carry different strengths or frequencies, distributing importance proportionally to both incoming and outgoing edge weights rather than treating all links equally. This makes it substantially more informative than binary PageRank in any network where connection strength matters.