PageRank, Connecting a Line of Nodes with a Complete Graph

DOI10.1007/978-3-319-42105-6_12zbMath1405.68020OpenAlexW2586546288MaRDI QIDQ2974709

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_12

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 (3)

Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ Perturbed Markov chains with damping component ⋮ PageRank for networks, graphs, and Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive methods for the computation of PageRank
• PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph
• Markov Chains

This page was built for publication: PageRank, Connecting a Line of Nodes with a Complete Graph