Machine learningNetwork science

Dynamic Eigenvector Centrality

Dynamic eigenvector centrality extends the classic eigenvector centrality measure to networks that change over time. Rather than computing a single leading eigenvector on a static adjacency matrix, it tracks how a node's influence — defined by the importance of its neighbours — evolves across snapshots or time windows. The method is used in social network analysis, epidemiology, and information diffusion studies where network topology shifts continuously.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Lerman, K., Ghosh, R., & Kang, J. H. (2010). Centrality metric for dynamic networks. Proceedings of the 8th Workshop on Mining and Learning with Graphs (MLG '10). ACM. link
  2. Eigenvector centrality. Wikipedia. link

Related methods

ScholarGateDynamic Eigenvector Centrality (Dynamic Eigenvector Centrality in Temporal Networks). Retrieved 2026-06-04 from https://scholargate.app/tr/network-analysis/dynamic-eigenvector-centrality