Dynamic Degree Centrality
Dynamic Degree Centrality in Temporal Networks · Also known as: time-varying degree centrality, temporal degree centrality, evolving degree centrality, DDC
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.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use dynamic degree centrality when your network data carry timestamps or are collected across multiple waves, and when you need to understand whether node importance is stable or fluctuates over time. It is well suited to communication logs, longitudinal panel data on social ties, contact-tracing data, citation accumulation, and biological interaction sequences. Do not use it when data are available only as a single aggregate network with no temporal metadata — in that case, static degree centrality is appropriate. Avoid it when time windows are so coarse that meaningful dynamics are lost, or so fine that each snapshot is nearly empty.
Strengths & limitations
- Captures the temporal evolution of node importance that static centrality entirely misses.
- Distinguishes persistent hubs from transient burst connectors — a key distinction in epidemiology and influence propagation.
- Directly comparable to static degree centrality, making it easy to communicate to audiences familiar with network analysis.
- Computable from raw contact or event logs without requiring network reconstruction at a global snapshot level.
- Time-series output enables further analysis such as trend detection or change-point identification.
- Results are sensitive to the choice of time-window size; too coarse a window collapses dynamics, too fine leaves windows nearly empty.
- Requires timestamped or sequenced data; cannot be applied retrospectively to aggregate adjacency matrices.
- Computational cost scales with the number of time windows and network size, which can be substantial for large event logs.
- Does not account for directionality of ties or edge weights unless explicitly extended to directed or weighted variants.
Frequently asked
How should I choose the time-window size?
Align window size with the natural rhythm of the process: daily windows for contact data collected over weeks, weekly windows for longitudinal panel surveys, or event-driven windows for bursty interaction logs. Sensitivity analysis across multiple window sizes is strongly recommended.
How does dynamic degree centrality differ from static degree centrality?
Static degree centrality counts all edges in a single aggregate graph, ignoring when they occurred. Dynamic degree centrality computes degree separately for each time window, producing a temporal profile that reveals whether a node's hub status is stable, growing, or declining.
Can I use this method on weighted or directed networks?
Yes, with extensions. For weighted edges, use strength (sum of edge weights) per window instead of binary degree. For directed networks, compute in-degree and out-degree separately per window. Both variants are well established in the temporal network literature.
What software supports dynamic degree centrality?
Python libraries such as NetworkX (with manual slicing), Teneto, and graph-tool support temporal network analysis. R packages including tsna and ndtv provide tools for dynamic network data. MethodMind provides a guided workflow with automated window slicing and visualization.
Is time-averaged dynamic degree equivalent to static degree?
Only approximately. The time average of dynamic degree equals static degree when every edge appears exactly once across all windows. In practice, repeated contacts, bursty activity, and missing windows cause the two measures to diverge, and the difference itself is informative.
Sources
- 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 ↗
How to cite this page
ScholarGate. (2026, June 3). Dynamic Degree Centrality in Temporal Networks. ScholarGate. https://scholargate.app/en/network-analysis/dynamic-degree-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Degree CentralityNetwork analysis↔ compare
- Dynamic Community DetectionNetwork analysis↔ compare
- Temporal Network AnalysisNetwork analysis↔ compare
- Temporal Social Network AnalysisNetwork analysis↔ compare
- Weighted Degree CentralityNetwork analysis↔ compare