PageRank centrality for temporal networks

DOI10.1016/j.physleta.2019.01.041zbMath1471.91398OpenAlexW2913425789MaRDI QIDQ822935

N. E. Zubov

Publication date: 24 September 2021

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2019.01.041

zbMATH Keywords

centralityPageRanktemporal networksmulti-homogeneous maptransition probability tensors

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (4)

Improvement of network robustness against cascading failures based on the min-max edge-adding strategy ⋮ Modeling failure propagation to analyze the vulnerability of the complex electromechanical systems under network attacks ⋮ Influential node detection of social networks based on network invulnerability ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach

Uses Software

• SNAP
• Temporal_Eigenvector_Centrality

Cites Work

• Betweenness in time dependent networks
• Ranking the spreading ability of nodes in complex networks based on local structure
• The centrality index of a graph
• Authoritative sources in a hyperlinked environment
• Comparing Top k Lists
• Node and Layer Eigenvector Centralities for Multiplex Networks
• A Matrix Iteration for Dynamic Network Summaries
• Block Matrix Formulations for Evolving Networks

This page was built for publication: PageRank centrality for temporal networks