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.
|Place of Publication||Sophia Antipolis|
|Number of pages||28|
|Publication status||Published - Jan 2004|
|Name||Research Report / INRIA, ISSN 0249-6399|
- Perturbed Markov Chains
- Optimal Linking