ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Analiza centralności×Modele dyfuzji sieciowej×
DziedzinaAnaliza sieciAnaliza sieci
RodzinaProcess / pipelineProcess / pipeline
Rok powstania19791927 (epidemiological compartmental); 2003 (social influence cascade)
TwórcaLinton C. FreemanKermack & McKendrick (SIR/SIS, 1927); Kempe, Kleinberg & Tardos (Independent Cascade, 2003)
TypDescriptive / exploratory network measure familyStochastic / deterministic simulation on graphs
Źródło pierwotneFreeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗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. DOI ↗
Inne nazwyMerkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centralityepidemic spreading models, compartmental models, influence propagation models, Ağ Yayılım Modelleri (SIR, SIS, Independent Cascade)
Pokrewne55
PodsumowanieCentrality 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 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.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Centrality Analysis · Network Diffusion Models. Pobrano 2026-06-15 z https://scholargate.app/pl/compare