ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Temporal mellanliggande centralitet×Temporal gradcentralitet×
ÄmnesområdeNätverksanalysNätverksanalys
FamiljMachine learningMachine learning
Ursprungsår20122011–2012
UpphovspersonKim, H. & Anderson, R.; Holme, P. & Saramäki, J.Holme, P.; Saramaki, J.; Kim, H.; Anderson, R.
TypCentrality measure for temporal networksCentrality measure (temporal extension)
UrsprungskällaHolme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗
AliasTBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweennesstime-varying degree centrality, dynamic degree centrality, temporal node degree, TDC
Närliggande66
SammanfattningTemporal 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.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.
ScholarGateDatamängd
  1. v1
  2. 2 Källor
  3. PUBLISHED
  1. v1
  2. 2 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: Temporal Betweenness Centrality · Temporal Degree Centrality. Hämtad 2026-06-18 från https://scholargate.app/sv/compare