11. A computer-readable storage medium encoded with instructions for controlling a computing device to rank web pages with hyperlinks to other web pages, by a method comprising: generating transition probabilities of transitioning between pairs of a source web page and a direct target web page based on information available through each target web page of the source web page by factoring in information content of the target web pages; calculating scores of the web pages based on a stationary probability of the generated transition probabilities; searching for web pages to be included in a search result for a search request; and ranking web pages of the search result based on the calculated scores wherein the generated transition probabilities are represented by an initial transition matrix that is calculated according to the following: 
 P (N) =( D (N) ) −1 AD (N−1) where P (N) represents the initial transition matrix based on a look-ahead distance of N−1, A represents an adjacency matrix indicating links between documents, and D (N) represents a diagonal matrix with diagonal elements set to d (N) , where d (N) is calculated according to the following: 
 d (N) =Ad (N−1) where d (0) =(1, 1, . . . , 1) n T .
11. A computer-readable storage medium encoded with instructions for controlling a computing device to rank web pages with hyperlinks to other web pages, by a method comprising: generating transition probabilities of transitioning between pairs of a source web page and a direct target web page based on information available through each target web page of the source web page by factoring in information content of the target web pages; calculating scores of the web pages based on a stationary probability of the generated transition probabilities; searching for web pages to be included in a search result for a search request; and ranking web pages of the search result based on the calculated scores wherein the generated transition probabilities are represented by an initial transition matrix that is calculated according to the following: 
 P (N) =( D (N) ) −1 AD (N−1) where P (N) represents the initial transition matrix based on a look-ahead distance of N−1, A represents an adjacency matrix indicating links between documents, and D (N) represents a diagonal matrix with diagonal elements set to d (N) , where d (N) is calculated according to the following: 
 d (N) =Ad (N−1) where d (0) =(1, 1, . . . , 1) n T . 13. The computer-readable storage medium of claim 11 wherein the generating of the transition probabilities includes generating a transition probability matrix.