2007/09/13 by Konstantin Avrachenkov, Nelly Litvak, Avrachenkov, Konstantin +2 · 1 citation
Computer Science · Physics and Astronomy · #Advanced Text Analysis Techniques #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Web Data Mining and Analysis
paper · pdf · doi:10.48550/arxiv.0709.2016
openalex publication_date 2007/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank share of IN and SCC components remains high even for very large values of the damping factor, in spite of the fact that it drops to zero when c goes to one. However, a detailed study of the OUT component reveals the presence ``dead-ends'' (small groups of pages linking only to each other) that receive an unfairly high ranking when c is close to one. We argue that this problem can be mitigated by choosing c as small as 1/2.