Dynamic PageRank using evolving teleportation
From MaRDI portal
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Internet topics (68M11) Social networks; opinion dynamics (91D30)
Abstract: The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly generalizes PageRank because the importance of a node will converge to the PageRank values if the external influence stops changing. We demonstrate the effectiveness of the evolving teleportation on the Wikipedia graph and the Twitter social network. The external interest is given by the number of hourly visitors to each page and the number of monthly tweets for each user.
Recommendations
Cited in
(8)- PageRank in evolving tree graphs
- A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks
- A Dynamical System for PageRank with Time-Dependent Teleportation
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Eigenvector-based centrality measures for temporal networks
- Supracentrality analysis of temporal networks with directed interlayer coupling
- Time-dependent personalized PageRank for temporal networks: discrete and continuous scales
- Dynamic pagerank: algorithms and lower bounds
This page was built for publication: Dynamic PageRank using evolving teleportation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900591)
