PageRank for networks, graphs, and Markov chains

DOI10.1090/TPMS/1034zbMath1402.60115OpenAlexW2895609703WikidataQ129132431 ScholiaQ129132431MaRDI QIDQ4686488

Sergei D. Silvestrov, Christopher Engström

Publication date: 10 October 2018

Published in: Theory of Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/tpms/1034

zbMATH Keywords

graphMarkov chainrandom walkPageRankstrongly connected component

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

Hitting times in Markov chains with restart and their application to network centrality ⋮ Perturbed Markov chains with damping component ⋮ Coupling and ergodic theorems for Markov chains with damping component

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-stationary phenomena in nonlinearity perturbed stochastic systems.
• The mathematics of internet search engines
• Adaptive methods for the computation of PageRank
• Analytic Perturbation Theory and Its Applications
• Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
• PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph
• PageRank, Connecting a Line of Nodes with a Complete Graph
• Generalisation of the Damping Factor in PageRank for Weighted Networks
• Nonlinearly Perturbed Semi-Markov Processes
• A Reordering for the PageRank Problem
• Depth-First Search and Linear Graph Algorithms
• A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations

This page was built for publication: PageRank for networks, graphs, and Markov chains