ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Analyse de la diffusion en réseau×Centralité de vecteur propre×
DomaineAnalyse de réseauxAnalyse de réseaux
FamilleMachine learningMachine learning
Année d'origine1927 (epidemic roots); network formalization 1990s–2000s1972
Auteur d'origineKermack, W. O. & McKendrick, A. G.Bonacich, P.
TypeSimulation / analytical modelCentrality measure
Source fondatriceKermack, 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 ↗Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗
Aliasdiffusion on networks, information diffusion, contagion spreading model, network propagation modeleigenvector centrality, EC, Bonacich centrality, power centrality
Apparentées56
Résumé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.Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Download slides

ScholarGateComparer des méthodes: Network Diffusion Analysis · Eigenvector Centrality. Consulté le 2026-06-15 sur https://scholargate.app/fr/compare