ScholarGate
Asistent

Compară metode

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

Analiza Rețelelor Temporale Ponderate×Analiza rețelelor multiplex×
DomeniuAnaliza rețelelorAnaliza rețelelor
FamilieMachine learningMachine learning
Anul apariției2004–20122014
Autorul originalHolme, P. & Saramaki, J. (temporal networks); Barrat et al. (weighted networks)Kivela, M.; Boccaletti, S. et al.
TipNetwork analysis techniqueStructural network model
Sursa seminalăHolme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271. DOI ↗
Denumiri alternativeWTNA, weighted time-varying network analysis, weighted dynamic network analysis, weighted evolving network analysismultiplex networks, multi-layer network analysis, multilayer network analysis, MNA
Înrudite66
RezumatWeighted temporal network analysis studies networks whose edges carry numerical weights — representing interaction strength, frequency, or intensity — and whose structure changes over time. It combines the time-varying perspective of temporal network analysis with the quantitative precision of weighted graph metrics, revealing not only when connections exist but how strong they are at each moment.Multiplex network analysis studies systems where the same set of nodes is connected by multiple distinct types of relationships, each represented as a separate network layer. By analyzing layers simultaneously rather than in isolation, it reveals how different relation types interact, reinforce each other, or compensate for one another across the same actors or entities.
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 Temporal Network Analysis · Multiplex Network Analysis. Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare