EECS 328 – Homework 3.
Methods for ranking web pages.
due Wed April 20, 2011
Turn in problems 1, 2a, 2b at class time; the rest through Blackboard. On Monday, I
will go over the homework in detail to make sure that you know precisely what you are
being asked.
Read the paper by Higham and Taylor on the page rank problem. The equation numbers
referenced below correspond to that paper. The data needed for this homework is contained
in the file
hmdata.zip
; see item 5 on blackboard. After you unzip it you should get the
files
EECS.dat
,
EECS
URL.dat
,
stanfordweb.dat
,
loadStanfordMatrix.m
It is important that your codes use
sparse computations
. In
matlab
all you need to do
is define a matrix to be sparse through the
sparse
command; Matlab will then perform all
operations using sparse operations. For example, consider the adjacency matrix
W
of the
example given in Figure 1 of Higham & Taylor
>> W = [ 0 1 1 1 ; 1 0 0 0 ; 1 0 0 0 ; 1 0 1 0 ];
its definition as a sparse matrix is
>> sW = sparse(W);
where
sW
has the following structure
sW =
(2,1)
1
(3,1)
1
(4,1)
1
(1,2)
1
(1,3)
1
(4,3)
1
(1,4)
1
1. Show that the PageRank iteration described by equation (1) is equivalent to the
Jacobi iteration applied to the system described in equation (3).
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
2. Now consider the example given in Figure 4 of Higham & Taylor.
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '11
 N/A
 Economics, Matrices, adjacency matrix, PageRank, Higham, Higham & Taylor

Click to edit the document details