Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Аналіз поширення в мережі× | Центральність за посередництвом× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1927 (epidemic roots); network formalization 1990s–2000s | 1977 |
| Автор методу≠ | Kermack, W. O. & McKendrick, A. G. | Freeman, L. C. |
| Тип≠ | Simulation / analytical model | Centrality measure |
| Основоположне джерело≠ | 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 ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| Інші назви | diffusion on networks, information diffusion, contagion spreading model, network propagation model | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| Пов'язані≠ | 5 | 6 |
| Підсумок≠ | 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. | Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes. |
| ScholarGateНабір даних ↗ |
|
|