Random walk centrality for temporal networks

Random walk centrality for temporal networks

Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on st...

Full description

Bibliographic Details
Main Authors: Luis E C Rocha, Naoki Masuda
Format: Article
Language:English
Published: IOP Publishing 2014-01-01
Series:New Journal of Physics
Subjects:
random walks
temporal networks
TempoRank
network centrality
stationary state
network analysis
Online Access:https://doi.org/10.1088/1367-2630/16/6/063023

Internet

https://doi.org/10.1088/1367-2630/16/6/063023

Similar Items