Limit of PageRank with damping factor

MaRDI QIDQ5486034zbMATH OpenFDO

Authors Ying Bao, Yong Liu

Publication date 6 September 2006

zbMATH Keywords

Markov chainPageRankinvariant probability

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Artificial intelligence (68T99)

Recommendations

• RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
• Some recent results on ranking webpages and websites
• Google pageranking problem: The model and the analysis
• On some analytical properties of a general PageRank algorithm
• On the convergence of the minimally irreducible Markov chain method with applications to PageRank

Cited in

(3)

• Generalisation of the Damping Factor in PageRank for Weighted Networks
• A Singular Perturbation Approach for Choosing the PageRank Damping Factor
• On the convergence of the minimally irreducible Markov chain method with applications to PageRank

This page was built for publication: Limit of PageRank with damping factor

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