\documentclass{article}

% Packages required to support encoding
\usepackage{ucs}
\usepackage[utf8x]{inputenc}

% Packages required by code


% Packages always used
\usepackage{hyperref}
\usepackage{xspace}
\usepackage[usenames,dvipsnames]{color}
\hypersetup{colorlinks=true,urlcolor=blue}

\input{preamble.tex}


\begin{document} 
\hypertarget{homework_3_1}{}\section*{{Homework 3}}\label{homework_3_1}

These problems are due in-class on November 3rd.

\hypertarget{problem_1_5_pts_2}{}\subsection*{{Problem 1 (5 pts)}}\label{problem_1_5_pts_2}

For a simple, undirected graph, show that the sum of the eigenvalues of its adjacency matrix must be equal to 0.\newline (This is a quick problem.)

\hypertarget{problem_2_10_pts_3}{}\subsection*{{Problem 2 (10 pts)}}\label{problem_2_10_pts_3}

You'{}ve recently been hired as a senior researcher at Bingle!, a new scrappy search startup. They want to test out some algorithms for weakly preferential PageRank because they don'{}t think that resetting ``{}everywhere''{} from a dangling node is a realistic model. However, they only have a routine to compute a strongly preferential PageRank vector. That is, they have a program {\colorbox[rgb]{1.00,0.93,1.00}{\tt pagerank\char40alpha\char44v\char41}} that solves the system

\begin{displaymath}
(\eye - \alpha \mPbar - \alpha \vv \vd^T) \vx = (1-\alpha)\vv
\end{displaymath}
on their distributed MapReduce cluster for their current crawl of the web. The matrix $\mPbar$ is a column sub-stochastic matrix from a hand-tuned random walk process on their web graph, and $\vd = \ve^T - \ve^T\mPbar$ is the dangling node vector\newline It'{}s very time-consuming and expensive to change that code (and so, for this problem, you cannot). They'{}ve asked you to determine if there is another way to compute weakly preferential PageRank.

Thankfully, you'{}ve taken CS-59000 NMC at Purdue, and this is your chance to shine and earn your yearly bonus early. Show how to compute a weakly preferential PageRank vector by using their {\colorbox[rgb]{1.00,0.93,1.00}{\tt pagerank\char40alpha\char44v\char41}} routine and one additional routine {\colorbox[rgb]{1.00,0.93,1.00}{\tt mult\char40x\char41}} which computes $\mPbar \vx$. Psst, the weakly preferential PageRank system is:

\begin{displaymath}
(\eye -\alpha \mPbar - \alpha \vu \vd^T) \vy = (1-\alpha) \vv.
\end{displaymath}
\hypertarget{problem_3_10_pts_4}{}\subsection*{{Problem 3 (10 pts)}}\label{problem_3_10_pts_4}

Google recently announced a change in how they process {\colorbox[rgb]{1.00,0.93,1.00}{\tt rel\char61nofollow}} links on the web. Please read about it here: \url{http://www.mattcutts.com/blog/pagerank-sculpting/} Mathematically describe how this change affects how Google constructs the matrix $\mP$ for PageRank.

\hypertarget{problem_4_10_pts_5}{}\subsection*{{Problem 4 (10 pts)}}\label{problem_4_10_pts_5}

Bingle! is back with another problem. One of their interns implemented a super-duper fast routine to compute a PseudoRank vector:

\begin{displaymath}
(\eye - \alpha \mPbar) \vy = \vv.
\end{displaymath}
This intern claimed that they could replace all their PageRank computations using this routine if they just normalized $\vy$, i.e. $\vx = \vy/\normof{\vy}$. Unfortunately, the intern was hired by the White House to help manage the government'{}s data efforts and left without justifying this result. There is apparently no time left to handle Bingle!'{}s email'{}s marked URGENT!

And so, they come to you. Can you solve the mystery of the normalization? To be precise, show exactly that $\normof{\vy}$ is the correct adjustment to $\vy$.

\hypertarget{problem_5_5_pts_6}{}\subsection*{{Problem 5 (5 pts)}}\label{problem_5_5_pts_6}

Tell me your preferred ranking of the following days for the in-class presentations:

\begin{itemize}%
\item November 15th
\item November 22nd
\item November 29th
\item December 1st

\end{itemize}
Rank each day from 1-4. There is no guarantee I'{}ll be able to assign you to the day you'{}d like, but we'{}ll see what we can do.

Due to scheduling details at the end of class, we will have to adjust the length of the presentations. We need two people to volunteer to split their presentation over two days (so we can do 2.5 presentations a day). If you'{}d be willing to split your presentation, please let me know.


\end{document}
