השוואת שיטות

	ניתוח דיפוזיה ברשתות משוקללות	מרכזיות ביניים משוקללת
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Machine learning	Machine learning
שנת המקור	2004	2010
הוגה השיטה	Barrat, A.; Newman, M. E. J.	Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001)
סוג	Network diffusion model	Centrality measure (path-based)
מקור מכונן	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.	Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251.
כינויים	WNDA, weighted diffusion process, edge-weighted spreading analysis, weighted information diffusion	WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted)
קשורות	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 Betweenness Centrality extends Freeman's betweenness measure to edge-weighted graphs by routing shortest paths through a tunable transformation of edge weights. Nodes that sit on many high-value shortest paths receive high scores, identifying brokers and bridges in social, biological, and information networks where tie strength matters.