ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

مركزية الدرجة الديناميكية×مركزية الدرجة×
المجالتحليل الشبكاتتحليل الشبكات
العائلةMachine learningMachine learning
سنة النشأة20121978
صاحب الطريقةHolme, P. & Saramaki, J.; Kim, H. & Anderson, R.Freeman, L. C.
النوعCentrality measure (temporal extension)Node-level centrality measure
المصدر التأسيسي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 ↗
الأسماء البديلةtime-varying degree centrality, temporal degree centrality, evolving degree centrality, DDCnode degree, degree score, DC, connectivity centrality
ذات صلة56
الملخصDynamic degree centrality extends the classical degree centrality measure to networks that change over time. Rather than counting a node's connections in a single static snapshot, it tracks how many contacts each node maintains across successive time windows or contact events, producing a time-resolved importance profile for every actor in the network.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Dynamic Degree Centrality · Degree Centrality. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare