Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Analisis Penyebaran Rangkaian Temporal× | Kemeradulan Rentasan Masa× | |
|---|---|---|
| Bidang | Analisis Rangkaian | Analisis Rangkaian |
| Keluarga | Machine learning | Machine learning |
| Tahun asal | 2012 | 2012 |
| Pengasas≠ | Holme, P. & Saramäki, J. | Kim, H. & Anderson, R.; Holme, P. & Saramäki, J. |
| Jenis≠ | Network analysis framework | Centrality measure for temporal networks |
| Sumber perintis≠ | Holme, P. & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ | Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ |
| Alias | TNDA, dynamic network diffusion, time-varying network spreading, diffusion on temporal networks | TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness |
| Berkaitan≠ | 5 | 6 |
| Ringkasan≠ | Temporal Network Diffusion Analysis studies how information, disease, influence, or other contagions spread through networks whose structure changes over time. By modeling edges as time-stamped contacts rather than static links, it captures the critical role of timing and ordering in determining which nodes get reached, how fast, and through which pathways — producing conclusions that static network models systematically miss. | Temporal Betweenness Centrality (TBC) extends classical betweenness centrality to time-stamped networks by counting how often a node lies on time-respecting shortest paths — paths that traverse edges in chronological order. It identifies nodes that act as temporal brokers, controlling information or resource flow as it evolves over time, rather than in a static snapshot. |
| ScholarGateSet data ↗ |
|
|