Machine learningNetwork science

Temporal Degree Centrality

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.

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.004
  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

ScholarGateTemporal Degree Centrality (Temporal Degree Centrality in Time-Varying Networks). Retrieved 2026-06-04 from https://scholargate.app/en/network-analysis/temporal-degree-centrality