Decomposition of the Google PageRank and Optimal Linking StrategyReportar como inadecuado




Decomposition of the Google PageRank and Optimal Linking Strategy - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 MAESTRO - Models for the performance analysis and the control of networks CRISAM - Inria Sophia Antipolis - Méditerranée 2 EEMCS - Faculty of Electrical Engineering, Mathematics and Computer Science Twente

Abstract : We provide the analysis of the Google PageRank from the perspective of the Markov Chain Theory. First we study the Google PageRank for a Web that can be decomposed into several connected components which do not have any links to each other. We show that in order to determine the Google PageRank for a completely decomposable Web, it is sufficient to compute a subPageRank for each of the connected components separately. Then, we study incentives for the Web users to form connected components. In particular, we show that there exists an optimal linking strategy that benefits a user with links inside its Web community and in contrast inappropriate links penalize the Web users and their Web communities.

Keywords : DECOMPOSITION OPTIMAL LINKING PERTURBED MARKOV CHAINS GOOGLE PAGERANK





Autor: Konstantin Avrachenkov - Nelly Litvak -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados