Machine learningNetwork science

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI: 10.1016/j.physrep.2012.04.001
  2. Kim, H. & Anderson, R. (2012). Temporal node centrality in complex networks. Physical Review E, 85(2), 026107. DOI: 10.1103/PhysRevE.85.026107

Related methods

Referenced by

ScholarGateDynamic Degree Centrality (Dynamic Degree Centrality in Temporal Networks). Retrieved 2026-06-04 from https://scholargate.app/en/network-analysis/dynamic-degree-centrality