ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Dinamička centralnost po stupnju×Vremenska analiza mreža×
PodručjeAnaliza mrežaAnaliza mreža
ObiteljMachine learningProcess / pipeline
Godina nastanka20122012
TvoracHolme, P. & Saramaki, J.; Kim, H. & Anderson, R.Holme & Saramäki (2012) — seminal framework
VrstaCentrality measure (temporal extension)Dynamic graph analysis
Temeljni izvorHolme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Holme, P. & Saramäki, J. (2012). Temporal Networks. Physics Reports, 519(3), 97-125. DOI ↗
Drugi nazivitime-varying degree centrality, temporal degree centrality, evolving degree centrality, DDCdynamic network analysis, time-varying network analysis, Zamansal Ağ Analizi (Temporal / Dynamic Networks)
Srodne53
SažetakDynamic 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.Temporal network analysis, formalised by Holme and Saramäki in their landmark 2012 Physics Reports survey, is the study of networks in which edges appear and disappear over time. Rather than collapsing all contacts into a single static graph, the approach preserves the precise timing of interactions — whether as contact sequences, time-stamped event lists, or windowed snapshots — and uses that timing to track how influence, disease, or information can actually propagate through the system.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Dynamic Degree Centrality · Temporal Network Analysis. Preuzeto 2026-06-17 s https://scholargate.app/hr/compare