Random walk centrality for temporal networks
From MaRDI portal
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Social networks; opinion dynamics (91D30)
Abstract: Nodes can be ranked according to their relative importance within the 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, as for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks which we call TempoRank. While in a static network, the stationary density of the random walk is proportional to the degree or the strength of a node, we find that in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network. The stationary density also depends on the sojourn probability q which regulates the tendency of the walker to stay in the node. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers at the right moment (one of the principles of the PageRank), this effect is negligible in practice when the time order of link activation is included.
Recommendations
Cites work
- A matrix iteration for dynamic network summaries
- Approximating PageRank from In-Degree
- Efficient routeing in Poisson small-world networks
- Entropy of dialogues creates coherent structures in e-mail traffic
- Fastest Mixing Markov Chain on a Graph
- Google's PageRank and beyond. The science of search engine rankings
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 193169 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- Information dynamics shape the sexual networks of Internet-mediated prostitution
- Navigation in small-world networks: a scale-free continuum model
- Networks. An introduction.
- Random Walker Ranking for NCAA Division I-A Football
- What's in a crowd? Analysis of face-to-face behavioral networks
Cited in
(23)- On eigenvector-like centralities for temporal networks: discrete vs. continuous time scales
- Random walks and diffusion on networks
- Big networks: a survey
- Structural importance and evolution: an application to financial transaction networks
- Co-ranking for nodes, layers and timestamps in multilayer temporal networks
- Cover time in edge-uniform stochastically-evolving graphs
- Ranking in evolving complex networks
- A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks
- Spectral centrality measures in temporal networks
- Non-backtracking walk centrality for directed networks
- Null models for dynamic centrality in temporal networks
- Randomized reference models for temporal networks
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Eigenvector-based centrality measures for temporal networks
- Fixation probability in evolutionary dynamics on switching temporal networks
- Visualisation of structure and processes on temporal networks
- Continuous-time random walks and temporal networks
- Detecting the driver nodes of temporal networks
- Time-dependent personalized PageRank for temporal networks: discrete and continuous scales
- A Parrondo paradox in susceptible-infectious-susceptible dynamics over periodic temporal networks
- Betweenness in time dependent networks
- Efficient computation of f-centralities and nonbacktracking centrality for temporal networks
- PageRank centrality for temporal networks
This page was built for publication: Random walk centrality for temporal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143235)
