Compute the hubbiness and authority of each of the nodes in our original Web graph of Fig. 5.1.

Answer:Hubs and Authorities:

 It was proposed after page rank was implemented.

 It deals with iterative computation of fixed point involving repeated matrix vector
multiplication.
 We can compute hubs and authorities using HITS(Hyperlink Induced Topic
Search) algorithm.
 A good hub represents a page that pointed to many other pages.
 A good authority represented a page that was linked by many different hubs.

To identify the best hub and authority for the given graph calculate the hubs and
authority score using hits algorithm for K=3.

Here K is number of iterations.

Procedure:

 First calculate the adjacency matrix for the given web graph.
 Later find the transpose of the adjacency matrix.
 Now assume initial hub weight vector,u as 1.
 calculate authority weight vector ,v

                                         v=transpose of the adjacency matrix * u(updated)

 Now calculate the updated hub weight vector ,u = adjacency matrix * v

 Now repeat it for the next two iterations.
 We can stop the iterations until the values of hubs and authorities remains same.
The values of hubs and authorities are same for k=2 and 3, so we can stop the
iterations.