On eigenvector-like centralities for temporal networks: discrete vs. continuous time scales

DOI10.1016/j.cam.2017.05.019zbMath1422.05063OpenAlexW2619798370MaRDI QIDQ1676040

Miguel Romance, Julio Flores

Publication date: 3 November 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2017.05.019

zbMATH Keywords

approximation of networkseigenvector centrality measurestemporal complex networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (3)

Mathematical modeling and computational methods ⋮ A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks ⋮ Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks

Uses Software

• Temporal_Eigenvector_Centrality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Betweenness in time dependent networks
• Large-scale structure of time evolving citation networks
• Complex networks: structure and dynamics
• Spectral centrality measures in temporal networks
• Eigenvector centrality of nodes in multiplex networks
• Centralities of a network and its line graph: an analytical comparison by means of their irregularity
• Random walk centrality for temporal networks
• Measure Theory
• Eigenvector-Based Centrality Measures for Temporal Networks
• Networks

This page was built for publication: On eigenvector-like centralities for temporal networks: discrete vs. continuous time scales