Dynamic PageRank using evolving teleportation
DOI10.1007/978-3-642-30541-2_10zbMATH Open1342.68040DBLPconf/waw/RossiG12arXiv1203.6098OpenAlexW1877364359WikidataQ66711226 ScholiaQ66711226MaRDI QIDQ2900591FDOQ2900591
Authors: Ryan Anthony Rossi, David F. Gleich
Publication date: 23 July 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.6098
Recommendations
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Internet topics (68M11)
Cited In (7)
- PageRank in evolving tree graphs
- Time-dependent personalized PageRank for temporal networks: discrete and continuous scales
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Eigenvector-based centrality measures for temporal networks
- A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks
- A Dynamical System for PageRank with Time-Dependent Teleportation
- Supracentrality analysis of temporal networks with directed interlayer coupling
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)