Ranking websites

Sa？etak In this paper we describe the mathematical foundations of the Google’s PageRank algorithm. We explain two methods used by the algorithm. The first one, the method of powers, is an iterative method. The second method is founded on solving a system of linear equations. Both methods are related to the problem of finding an eigenvector of the dominant eigenvalue of the corresponding matrix. Functioning of the algorithm is illustrated on a small example of four web pages