Machine learningNetwork science

Temporal Betweenness Centrality

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.

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., & Saramäki, 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

ScholarGateTemporal Betweenness Centrality (Temporal Betweenness Centrality (Time-Respecting Path Betweenness)). Retrieved 2026-06-04 from https://scholargate.app/en/network-analysis/temporal-betweenness-centrality