Traditional and Lazy PageRanks for a line of nodes connected with complete graphs

DOI10.1007/978-3-030-02825-1_17zbMath1423.60114OpenAlexW2902051619MaRDI QIDQ2329123

John Magero Mango, Christopher Engström, Pitos Seleka Biganda, Godwin Kakuba, Benard Abola, Sergei D. Silvestrov

Publication date: 17 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-02825-1_17

zbMATH Keywords

random walkPageRankLazy PageRank

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Perturbed Markov chains with damping component ⋮ Coupling and ergodic theorems for Markov chains with damping component

This page was built for publication: Traditional and Lazy PageRanks for a line of nodes connected with complete graphs