# Universal Emergence of PageRank

@article{Frahm2011UniversalEO,
title={Universal Emergence of PageRank},
author={Klaus M. Frahm and Bertrand Georgeot and Dima L. Shepelyansky},
journal={ArXiv},
year={2011},
volume={abs/1105.1062}
}
• Published 5 May 2011
• Computer Science
• ArXiv
The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter $\alpha \in ]0,1[$. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of PageRank vector at its emergence when $\alpha \rightarrow 1$. The whole network can be divided into a core part and a group of invariant subspaces. For…
20 Citations

## Figures and Tables from this paper

Large-scale Sustainable Search on Unconventional Computing Hardware
• Computer Science
ArXiv
• 2021
It is demonstrated that special-purpose optical machines such as networks of optical parametric oscillators, lasers, and gain-dissipative condensates, may aid in accelerating the reliable reconstruction of principal eigenvectors of real-life web graphs.
Application of the Google matrix methods for characterization of directed networks
These applications show how the information brought by the PageRank can be useful in various situations to gain some interesting or original insight about the studied system and how it is helping to understand the organization of the underlying directed network.
Anderson transition for Google matrix eigenstates
• Physics, Computer Science
ArXiv
• 2015
A number of random matrix models describing the Google matrix G of directed networks show that for certain models it is possible to have an algebraic decay of PageRank vector with the exponent similar to real directed networks.
PageRank model of opinion formation on social networks
• Computer Science
Physica A: Statistical Mechanics and its Applications
• 2019
Google matrix analysis of directed networks
• Computer Science
ArXiv
• 2014
This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency on various examples including World Wide Web, Wikipedia, software architecture, world trade, social and citation networks, brain neural networks, DNA sequences and Ulam networks.
• Computer Science, Mathematics
The European Physical Journal B
• 2018
The Google matrix analysis of bitcoin network gives a new understanding of the bitcoin transactions with PageRank and CheiRank characterization of sellers and buyers which are dominant not simply due to the sold/bought volume but also by taking into account if bitcoins are sold to (bought by) other important sellers (buyers).
Towards two-dimensional search engines
• Computer Science
ArXiv
• 2011
The statistical properties of information flow on PageRank-CheiRank plane are analyzed for networks of British, French and Italian Universities, Wikipedia, Linux Kernel, gene regulation and other networks and methods of spam links control are analyzed.
• Economics
ArXiv
• 2011
The study establishes the existence of two solid state like domains of rich and poor countries which remain stable in time, while the majority of countries are shown to be in a gas like phase with strong rank fluctuations.
Google Matrix Analysis of DNA Sequences
• Physics
PloS one
• 2013
The PageRank proximity correlator between different species which determines their statistical similarity from the view point of Markov chains is introduced and establish scale-free features of DNA sequence networks showing their similarities and distinctions with the WWW and linguistic networks.
Time evolution of Wikipedia network ranking
• Computer Science
ArXiv
• 2013
It is shown that PageRank selection is dominated by politicians while 2DRank, which combines PageRank and CheiRank, gives more accent on personalities of arts.

## References

SHOWING 1-10 OF 48 REFERENCES
Delocalization transition for the Google matrix
• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
It is argued that, for networks with delocalized PageRank, the efficiency of information retrieval by Google-type search is strongly affected since the PageRank values have no clear hierarchical structure in this case.
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
We consider the web hyperlink matrix used by Google for computing the PageRank whose form is given by A(c)=[cP +(1-c)E]T, where P is a row stochastic matrix, E is a row stochastic rank one matrix,
Distribution of PageRank Mass Among Principle Components of the Web
• Mathematics
WAW
• 2007
A detailed study of the OUT component reveals the presence of "dead-ends" (small groups of pages linking only to each other) that receive an unfairly high ranking when c is close to one, and argues that this problem can be mitigated by choosing c as small as 1/2.
Probabilistic Relation between In-Degree and PageRank
• Computer Science, Mathematics
WAW
• 2006
Using the theory of regular variation and Tauberian theorems, it is proved that the tail distributions of PageRank and In-Degree differ only by a multiplicative constant, for which they derive a closed-form expression.
Using PageRank to Characterize Web Structure
• Computer Science, Mathematics
Internet Math.
• 2006
It is suggested that PageRank values on the web follow a power law, and generative models for the web graph are developed that explain this observation and moreover remain faithful to previously studied degree distributions.
PageRank: Functional dependencies
• Computer Science
TOIS
• 2009
PageRank is an interesting mathematical subject that has inspired research in a number of fields and is likely that in certain areas, for instance selective crawling and inverted index reordering (permuting documents so that more important documents are returned first), PageRank (or one of its many variants) is still very useful.
Diffusion of scientific credits and the ranking of scientists
• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
This work takes advantage of the entire Physical Review publication archive to construct authors' networks where weighted edges, as measured from opportunely normalized citation counts, define a proxy for the mechanism of scientific credit transfer.
Google's PageRank and beyond - the science of search engine rankings
• Computer Science
• 2006
Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided.
Two-dimensional ranking of Wikipedia articles
• Computer Science
ArXiv
• 2010
Using CheiRank and PageRank the authors analyze the properties of two-dimensional ranking of all Wikipedia English articles and show that it gives their reliable classification with rich and nontrivial features.