1. Given the graph below, compute the rank of nodes A, B, and C by setting up the flow equations with the constraint that the sum of ranks is 1, and then solving the equations for the rank values. Make sure to show/explain the steps.

A ?B

C

(The image shows 3 corners of triangle with arrowa A->C, C->B, B->A, A->C)

A. Given the following adjacency matrix, use the power iteration method to find the approximate rank vector. Do 3 iterations and show your work.

1/2 1/3 0

1/2 1/3 0

0 1/3 1

(above is inside matrix)

B. Assume you have the adjacency matrix given in problem 2. Use the PageRank equation with?=0.9 to compute the rank vector using the power iteration method. Do 3 iterations and show your work.