方法证据记录
Dynamic Degree Centrality
Dynamic degree centrality extends the classical degree centrality measure to networks that change over time. Rather than counting a node's connections in a single static snapshot, it tracks how many contacts each node maintains across successive time windows or contact events, producing a time-resolved importance profile for every actor in the network.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Dynamic Degree Centrality in Temporal Networks
分类方法记录 · ml-model / network-analysis
- Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. · DOI 10.1016/j.physrep.2012.03.001
- Kim, H. & Anderson, R. (2012). Temporal node centrality in complex networks. Physical Review E, 85(2), 026107. · DOI 10.1103/PhysRevE.85.026107
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。