Random walk centrality for temporal networks

DOI10.1088/1367-2630/16/6/063023zbMath1451.60083arXiv1401.5648OpenAlexW1974030687MaRDI QIDQ5143235

Luis E. C. Rocha, Naoki Masuda

Publication date: 11 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.5648

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) 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)

Related Items (10)

Ranking in evolving complex networks ⋮ On eigenvector-like centralities for temporal networks: discrete vs. continuous time scales ⋮ Fixation probability in evolutionary dynamics on switching temporal networks ⋮ Random walks and diffusion on networks ⋮ A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks ⋮ Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ Big networks: a survey ⋮ Cover time in edge-uniform stochastically-evolving graphs ⋮ Structural importance and evolution: an application to financial transaction networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What's in a crowd? Analysis of face-to-face behavioral networks
• Information dynamics shape the sexual networks of Internet-mediated prostitution
• Approximating PageRank from In-Degree
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Fastest Mixing Markov Chain on a Graph
• A Matrix Iteration for Dynamic Network Summaries
• Navigation in small-world networks: a scale-free continuum model
• Random Walker Ranking for NCAA Division I-A Football
• Entropy of dialogues creates coherent structures in e-mail traffic
• Efficient routeing in Poisson small-world networks
• Networks

This page was built for publication: Random walk centrality for temporal networks