Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Centralità di Vicinanza Temporale× | Centralità di grado temporale× | |
|---|---|---|
| Campo | Analisi delle reti | Analisi delle reti |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 2011 | 2011–2012 |
| Ideatore≠ | Pan, R. K. & Saramaki, J. | Holme, P.; Saramaki, J.; Kim, H.; Anderson, R. |
| Tipo≠ | Centrality measure (temporal) | Centrality measure (temporal extension) |
| Fonte seminale≠ | Pan, R. K., & Saramaki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1), 016105. DOI ↗ | Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Alias | time-varying closeness centrality, dynamic closeness centrality, TCC, temporal reachability-based centrality | time-varying degree centrality, dynamic degree centrality, temporal node degree, TDC |
| Correlati | 6 | 6 |
| Sintesi≠ | Temporal closeness centrality extends the classical closeness measure to time-varying networks by replacing static shortest paths with time-respecting (foremost) paths. It quantifies how quickly a node can reach all other nodes when interactions occur at specific moments in time, giving a more realistic picture of information flow, disease spread, and influence in dynamic systems. | Temporal degree centrality extends the classic degree centrality to time-varying networks by counting how many distinct contacts a node accumulates over time. Rather than collapsing a dynamic network into a single static graph, it preserves the temporal order of edges, yielding a more faithful measure of a node's activity and reachability across the observation window. |
| ScholarGateInsieme di dati ↗ |
|
|