A singular perturbation approach for choosing PageRank damping factor

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages; 6 figures

Scientific paper

The choice of the PageRank damping factor is not evident. The Google's choice for the value c=0.85 was a compromise between the true reflection of the Web structure and numerical efficiency. However, the Markov random walk on the original Web Graph does not reflect the importance of the pages because it absorbs in dead ends. Thus, the damping factor is needed not only for speeding up the computations but also for establishing a fair ranking of pages. In this paper, we propose new criteria for choosing the damping factor, based on the ergodic structure of the Web Graph and probability flows. Specifically, we require that the core component receives a fair share of the PageRank mass. Using singular perturbation approach we conclude that the value c=0.85 is too high and suggest that the damping factor should be chosen around 1/2. As a by-product, we describe the ergodic structure of the OUT component of the Web Graph in detail. Our analytical results are confirmed by experiments on two large samples of the Web Graph.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A singular perturbation approach for choosing PageRank damping factor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A singular perturbation approach for choosing PageRank damping factor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A singular perturbation approach for choosing PageRank damping factor will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-649763

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.