ScholarGate
Asistent

Compară metode

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

Centralitatea de grad ponderat×Centralitatea de grad×
DomeniuAnaliza rețelelorAnaliza rețelelor
FamilieMachine learningMachine learning
Anul apariției20041978
Autorul originalBarrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A.Freeman, L. C.
TipCentrality measure for weighted networksNode-level centrality measure
Sursa seminalăBarrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗
Denumiri alternativenode strength, strength centrality, weighted node degree, WDCnode degree, degree score, DC, connectivity centrality
Înrudite66
RezumatWeighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score.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: Weighted Degree Centrality · Degree Centrality. Preluat la 2026-06-19 de pe https://scholargate.app/ro/compare