ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Centralitatea de grad temporal×Centralitatea de grad×
DomeniuAnaliza rețelelorAnaliza rețelelor
FamilieMachine learningMachine learning
Anul apariției2011–20121978
Autorul originalHolme, P.; Saramaki, J.; Kim, H.; Anderson, R.Freeman, L. C.
TipCentrality measure (temporal extension)Node-level centrality measure
Sursa seminalăHolme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗
Denumiri alternativetime-varying degree centrality, dynamic degree centrality, temporal node degree, TDCnode degree, degree score, DC, connectivity centrality
Înrudite66
RezumatTemporal 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.Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Temporal Degree Centrality · Degree Centrality. Preluat la 2026-06-18 de pe https://scholargate.app/ro/compare