PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph

DOI10.1007/978-3-319-42105-6_11zbMath1405.68019OpenAlexW2586681551MaRDI QIDQ2974708

Christopher Engström, Sergei D. Silvestrov

Publication date: 10 April 2017

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42105-6_11

zbMATH Keywords

graphrandom walkblock matrixPageRank

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Internet topics (68M11) Random walks on graphs (05C81)

Related Items (4)

Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ PageRank, Connecting a Line of Nodes with a Complete Graph ⋮ Perturbed Markov chains with damping component ⋮ PageRank for networks, graphs, and Markov chains

Cites Work

• The mathematics of internet search engines
• Adaptive methods for the computation of PageRank
• The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
• Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph