Abstract
                                                                        — The effect of adjusting damping factor α and tolerance τ on iterations  needed for PageRank computation is studied here. Relative performance of  PageRank computation with L1, L2, and L∞ norms used as convergence check, are  also compared with six possible mean ratios. It is observed that increasing the  damping factor α linearly increases the iterations needed almost exponentially. On  the other hand, decreasing the tolerance τ exponentially decreases the iterations  needed almost exponentially. On average, PageRank with L∞ norm as convergence  check is the fastest, quickly followed by L2 norm, and then L1 norm. For large  graphs, above certain tolerance τ values, convergence can occur in a single iteration.  On the contrary, below certain tolerance τ values, sensitivity issues can begin to  appear, causing computation to halt at maximum iteration limit without convergence.  The six mean ratios for relative performance comparison are based on arithmetic,  geometric, and harmonic mean, as well as the order of ratio calculation. Among  them GM-RATIO, geometric mean followed by ratio calculation, is found to be most  stable, followed by AM-RATIO.