ScholarGate
Assistent

Methoden vergleichen

Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.

Netzwerk-Diffusionsmodelle×Zentralitätsanalyse×
FachgebietNetzwerkanalyseNetzwerkanalyse
FamilieProcess / pipelineProcess / pipeline
Entstehungsjahr1927 (epidemiological compartmental); 2003 (social influence cascade)1979
UrheberKermack & McKendrick (SIR/SIS, 1927); Kempe, Kleinberg & Tardos (Independent Cascade, 2003)Linton C. Freeman
TypStochastic / deterministic simulation on graphsDescriptive / exploratory network measure family
Wegweisende QuelleKermack, 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. DOI ↗Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗
Aliasnamenepidemic 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
Verwandt55
ZusammenfassungNetwork 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.
ScholarGateDatensatz
  1. v1
  2. 2 Quellen
  3. PUBLISHED
  1. v1
  2. 2 Quellen
  3. PUBLISHED

Zur Suche Folien herunterladen

ScholarGateMethoden vergleichen: Network Diffusion Models · Centrality Analysis. Abgerufen am 2026-06-15 von https://scholargate.app/de/compare