Math 445 lab 6: Google Page Rank

Problem 1: Hamster dynamics. Suppose you have 100 hamsters living in the following set of eight hamster houses connected by one-way tunnels.

Suppose that every minute at sound of a bell, each hamster runs down one of the tunnels in its present hamster house and appears in the house it connects to.

(a) Let $x_i^n$ represent the fraction of hamsters in the $i$ th house in the $n$ th minute. Write down a set of eight equations for $x^{n+1}_1$ through $x^{n+1}_8$ in terms of $x^{n}_1$ through $x^{n}_8$ .

(b) Let $x^n$ be the vector whose elements are $x^n_1, x^n_2, \ldots, x^n_8$ . Write the set of equations from (a) in terms of a matrix-vector multiplication, $x^{n+1} = A x^n$ .

(c) Write Matlab code to compute the steady-state distribution of hamsters by computing $x^n$ for some large value of $n$ , say $n=100$ . For $x^0$ , start with either the same fraction of hamsters in each house or a random set of fractions that totals to 1.

(d) Use Matlab's sort function to produce a list of the houses ranked in order of their steady-state populations.

Challenge: Revise your code show that uses Matlab's bar function to show a bar chart of the hamster distribution at each time step through the loop. Use Matlab's pause function to pause a short while on each step, so that you have time to see each bar chart.

Problem 2: Google Page Rank.

Note 3/21/2018: This problem has been revised slightly to ameliorate problems people have experienced with the surfer.m script and www.unh.edu.

Compute the Google Page Rank for a network of 32 pages within www.mit.edu, www.unh.edu, or another website of your choice.

(a) Download the surfer.m Matlab script (an updated version of a script from Numerical Computing with Matlab by Clive Moler). Then set M=32 and run the command [w,L] = surfer('http://www.unh.edu',M); (or whatever website you choose). After some time this will generate a vector $w$ of websites and a matrix $L$ of links between them. All the entries of $L$ should be either 0 or 1.

(b) Now from the matrix $L$ , generate a transition matrix $A$ that governs the dynamics of people clicking on random links, according to $x^{n+1} = A x^n$ . Similar to the hamster dynamics problem above, the $i$ th component of the vector $x^n$ is the fraction of websurfers visiting the $i$ th webpage at time $n$ . You will probably run into problem, namely a webpage might contain no links or only links outside the set of pages we are working with. In that case we will just assume that the person randomly selects a new website among all the $M$ pages in our set. Revise your calculation of $A$ so that if a column of $L$ sums to zero, then each of the entries in the same column of $A$ is $1/M$ .

(c) Suppose that instead of always clicking on a random link within a page, a web surfer sometimes (with probability $\alpha$ ) jumps to a random page chosen from all the pages in the network. We can model this behavior by using a modified transition matrix $B$ and dynamics $x^{n+1} = B x^n$ , as follows

$\begin{equation*} B = (1-\alpha) A + \alpha [1]/M \end{equation*}$

where $[1]$ is an $M \times M$ matrix of ones. Rumor has it that Google uses $\alpha = 0.15$ , so use that value and calculate $B$ .

(d) Double-check that the sum of each column of $B$ is 1. Again, be clever and get Matlab to do the work, rather than listing out the sums of all the columns and verifying manually that each of the $M$ numbers is 1!

(e) Let’s assume that all websurfers start at the first webpage, x=zeros(M,1); x(1)=1;. If we iteratively apply B to x many times (say 40 times), the resulting vector will give the probability that we end up on a particular website and after a long session of random web surfing. We can do this with a for-loop

N=40;
for n=1:N;
  x=B*x;
end

After that is complete the elements of x give the probabilities that a random web surfer will end up at the web pages listed in w, and you can rank the pages in w according to their probabilities in x. Look up the sort command in the Help menu and find a way to print the list of websites in order of their rank. Turn in the list of the top 10, the fraction of the time a random web surfer would spend in each one of those 10, and your code to complete the Lab.

(f) If you are interested: Our calculation involved two free parameters: the probability $\alpha$ of jumping to an entirely random page in the network, and $N$ , the number that specifies the length of our long session of random web surfing. How robust is the page rank algorithm with respect to these two parameters? If you change $\alpha$ to 0.1 or 0.05, do the top 10 pages change? How about if you change $M$ to 64, 128, 256, 512, or 1024? (some of these larger values might take a really long time).

Problem 3: Suppose that, instead of representing links between web pages, you have a directed graph that tells who likes whom among all students at UNH, obtained, for example, from their Facebook “friends” lists. You could then use the same algorithm to compute a numerical measure of each UNH student's likeability, and an overall ranking of the popularity of all UNH students.

What do you think of this proposal? Would the numerical values produced be meaningful measures of likeability or popularity? Why or why not? What does your answer here say about Google Page Rank as a method of ranking web pages?

Note: There is no single clear answer to this question. Just be thoughtful about it and express yourself clearly.

channelflow.org

User Tools

Site Tools

Math 445 lab 6: Google Page Rank

Page Tools