ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Pusat Darjah Temporal×Pusat Darjah×
BidangAnalisis RangkaianAnalisis Rangkaian
KeluargaMachine learningMachine learning
Tahun asal2011–20121978
PengasasHolme, P.; Saramaki, J.; Kim, H.; Anderson, R.Freeman, L. C.
JenisCentrality measure (temporal extension)Node-level centrality measure
Sumber perintisHolme, 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 ↗
Aliastime-varying degree centrality, dynamic degree centrality, temporal node degree, TDCnode degree, degree score, DC, connectivity centrality
Berkaitan66
RingkasanTemporal 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 data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Temporal Degree Centrality · Degree Centrality. Dicapai 2026-06-18 daripada https://scholargate.app/ms/compare