Results 1 -
2 of
2
Ranking WebSites, a Probabilistic View
"... In this paper we suggest evaluating the importance of a website with the mean fre-quency of visiting the website for the Markov chain on the Internet Graph describing random surfing. We show that this mean frequency is equal to the sum of the PageRanks of all the webpages in that website (hence is r ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
is referred to as PageRankSum), and propose a novel algorithm ’AggregateRank ’ based on the theory of stochastic complement to calcu-late the rank of a website. The AggregateRank Algorithm gives a good approximation of the PageRankSum accurately, while the corresponding computational complexity is much lower
Some Recent Results on Ranking Webpages and
"... In this paper we briefly review some of our recent results on the research of the design and analysis of search engine algorithms. The contents include: the limiting behavior of PageRank when the damping factor tends to 1; comparison of the convergence rate of maximal and minimal irreducible Markov ..."
Abstract
- Add to MetaCart
chains on the Internet; a new proposal of N-step PageRank algorithm; a new proposal of ranking Websites– AggregateRank Algorithm. As is well known that in recent years Web search engines have been