PageRank, a look at small changes in a line of nodes and the complete graph

DOI10.1007/978-3-319-42105-6_11zbMATH Open1405.68019OpenAlexW2586681551MaRDI QIDQ2974708FDOQ2974708

Authors: C. Engström, Sergei 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

Recommendations

• PageRank, Connecting a Line of Nodes with a Complete Graph
• PageRank for networks, graphs, and Markov chains
• The Effect of New Links on Google Pagerank
• Traditional and Lazy PageRanks for a line of nodes connected with complete graphs
• Link Evolution: Analysis and Algorithms

zbMATH Keywords

graphrandom walkPageRankblock matrix

Mathematics Subject Classification ID

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

Cites Work

• Markov Chains
• Title not available (Why is that?)
• Adaptive methods for the computation of PageRank
• Title not available (Why is that?)
• The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
• Title not available (Why is that?)
• The mathematics of internet search engines

Cited In (8)

• Link Evolution: Analysis and Algorithms
• Applications of Page Ranking in P Systems
• Perturbed Markov chains with damping component
• Traditional and Lazy PageRanks for a line of nodes connected with complete graphs
• PageRank, Connecting a Line of Nodes with a Complete Graph
• Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
• PageRank for networks, graphs, and Markov chains
• On the edges’ PageRank and line graphs

This page was built for publication: PageRank, a look at small changes in a line of nodes and the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2974708)