ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Viktad temporär nätverksanalys×Nätverksdiffusionsanalys×
ÄmnesområdeNätverksanalysNätverksanalys
FamiljMachine learningMachine learning
Ursprungsår2004–20121927 (epidemic roots); network formalization 1990s–2000s
UpphovspersonHolme, P. & Saramaki, J. (temporal networks); Barrat et al. (weighted networks)Kermack, W. O. & McKendrick, A. G.
TypNetwork analysis techniqueSimulation / analytical model
UrsprungskällaHolme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Kermack, W. O. & McKendrick, A. G. (1927). A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London A, 115(772), 700–721. DOI ↗
AliasWTNA, weighted time-varying network analysis, weighted dynamic network analysis, weighted evolving network analysisdiffusion on networks, information diffusion, contagion spreading model, network propagation model
Närliggande65
SammanfattningWeighted temporal network analysis studies networks whose edges carry numerical weights — representing interaction strength, frequency, or intensity — and whose structure changes over time. It combines the time-varying perspective of temporal network analysis with the quantitative precision of weighted graph metrics, revealing not only when connections exist but how strong they are at each moment.Network diffusion analysis models how information, diseases, behaviors, or innovations spread across a graph of nodes and edges. Drawing on classical epidemic theory (SI, SIR, SIS) and modern network science, it tracks which nodes become infected, how quickly, and whether the spread reaches a global cascade or dies out locally.
ScholarGateDatamängd
  1. v1
  2. 2 Källor
  3. PUBLISHED
  1. v1
  2. 2 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: Weighted Temporal Network Analysis · Network Diffusion Analysis. Hämtad 2026-06-15 från https://scholargate.app/sv/compare