Convergence of HITS (hyperlink-induced topic search) algorithm by Victor Boyarshinov. Was first introduced by Jon M. Kleinberg (1998).
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Convergence of HITS
(hyperlink-induced topic search)
by Victor Boyarshinov
Goal of the Experiments:
Determine how number of iterations increases with size of graph if average degree of a vertex remains the same (10).
The reason why attempt of convergence rate estimating failed is insufficient number of tests (computationally expensive!)
Another set of test examples was generated as follows: take two disjoint uniformly generated random graphs of size n, take any vertex v from the first graph, vertex u from the second graph and connect the components by adding edges (u, v) and (v, u).