A method of constructing the frame of a directed graph

In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.

Hofuku, I. and Oshima, K. (2010a). A mathematical structure of processes for generating rankings through the use of nonnegative irreducible matrices, Applied Mathematics and Information Science 4(1): 125-139.

Hofuku, I. and Oshima, K. (2012). A new ranking model using the power method, Applied Mathematics and Information Science 6(1): 75-84.