Pagerank Increase under Different Collusion Topologies.
Ricardo A. Baeza-Yates, Carlos Castillo, Vicente López · 2005
We study the impact of collusion –nepotistic linking – in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probabil-ity of the random walk ε and on the original Pagerank of the colluding set. In particular, due to the power law dis-tribution of Pagerank, we show that highly-ranked Web sites do not benefit that much from collusion. 1