Machine learningNetwork science

Temporal Closeness Centrality

Temporal closeness centrality extends the classical closeness measure to time-varying networks by replacing static shortest paths with time-respecting (foremost) paths. It quantifies how quickly a node can reach all other nodes when interactions occur at specific moments in time, giving a more realistic picture of information flow, disease spread, and influence in dynamic systems.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Pan, R. K., & Saramaki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1), 016105. DOI: 10.1103/PhysRevE.84.016105
  2. Holme, P., & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI: 10.1016/j.physrep.2012.03.001

Related methods

Referenced by

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