PageRank, Connecting a Line of Nodes with a Complete Graph

DOI10.1007/978-3-319-42105-6_12MaRDI QIDQ2974709zbMATH OpenOpenAlexFDO

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_12

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)

Recommendations

• PageRank, a look at small changes in a line of nodes and the complete graph
• Traditional and Lazy PageRanks for a line of nodes connected with complete graphs
• On the edges’ PageRank and line graphs
• PageRank Computation, with Special Attention to Dangling Nodes
• PageRank in Undirected Random Graphs
• A note on the PageRank of undirected graphs
• PageRank for networks, graphs, and Markov chains
• PageRank in evolving tree graphs

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 1945817 (Why is no real title available?)
• scientific article; zbMATH DE number 3296351 (Why is no real title available?)
• Adaptive methods for the computation of PageRank
• Markov Chains
• PageRank, a look at small changes in a line of nodes and the complete graph

Cited in

(7)

• PageRank, a look at small changes in a line of nodes and the complete graph
• Perturbed Markov chains with damping component
• Traditional and Lazy PageRanks for a line of nodes connected with complete graphs
• Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
• The PageRank model of minimal irreducible adjustment and its lumping method
• PageRank for networks, graphs, and Markov chains
• On the edges’ PageRank and line graphs

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

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