Comparing two page importance algorithms in probabilistic view

MaRDI QIDQ3071284zbMATH OpenFDO

Authors Yu-Ting Liu

Publication date 5 February 2011

zbMATH Keywords

BrowseRank algorithmcontinuous-time Markov processergodicity theoremPageRank algorithmstationary distribution

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Internet topics (68M11) Communication networks in operations research (90B18)

Recommendations

• Comparison of two algorithms for computing page importance
• Ranking Websites: A Probabilistic View
• scientific article; zbMATH DE number 5033859
• Some recent results on ranking webpages and websites
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient

Cited in

(2)

• Comparison of two algorithms for computing page importance
• Research on stochastic models and algorithms for web page ranking

This page was built for publication: Comparing two page importance algorithms in probabilistic view

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