Homework 4 was released today and is now available on the course web page. So begins Rankmaniac 2012... I look forward to seeing all the crazy things you do. (Remember not to get me, or Caltech, in too much trouble though!)

I will be willing to post links to peoples pages from the course website if so desired. There is a limit of 1 page per group that I will link to though. Post the link as a comment here if you'd like me to add it to the main page.

Good luck!

## Monday, January 30, 2012

Subscribe to:
Post Comments (Atom)

A few students asked today about finding a group for rankmaniac... I suggest that you post here if you're looking for group members. I'm sure you'll find others not yet in groups.

ReplyDeletemyrankmanic2012.blogspot.com

ReplyDeleteAlso, do we have to host the image or is just a reference to it fine?

the linked above was spelled wrong.... here's right right version:

Deletehttp://myrankmaniac2012.blogspot.com/

We'd prefer that you host the image as well.

Deletehttp://rankmaniac-2012.caltech.edu

ReplyDeleteYay! Rankmaniac 2012!

The sites above look nice, but I notice none of them features Taz. Maybe this site can remedy that: http://rankmaniac2012.caltech.edu

ReplyDeleteAlso, are we allowed to link to our Rankmaniac 2012 sites from required class blog posts? Particularly if we can find ways to make them semi-relevant?

It's a good idea, but please don't use your blog posts for this purpose.

DeleteMight as well link me as I've created a handy-dandy countdown til the end of the competition.

ReplyDeletehttp://www.ugcs.caltech.edu/~kratsg/RankManiac2011

PS: It's on my rankmaniac page ;)

Ha! You don't get a link this year Giordon. That's only for students in the class!

DeleteI need a group for Homework 4... I'm a first year EE Graduate Student, and my email is jli7@caltech.edu. Please email me if someone is interested in making a group. Thanks

ReplyDeleteHere's our page:

ReplyDeletehttp://2012rankmaniac.blogspot.com/

Rankmaniac 2012 Music Festival!

ReplyDeletehttp://rankmaniac2012.wordpress.com/

The group members are Kevin Lo, Nathan Watson, and Mikhail Sushkov

DeleteUpdate as of about a week ago: our group is now Kevin Lo, Nathan Watson, Mikhail Sushkov, and Stasja Stanisic

DeleteDone.

DeleteSorry for the delay in adding everyone's links. I will do that this weekend when I return to Pasadena...

ReplyDeleteOur page:

ReplyDeletehttp://2012rankmaniac.caltech.edu

Thanks!

Don't forget to have somewhere on your sites who the group members are. I added links to the course website for those groups above, but was not always sure who the group members were. You should check the links and let me know who I missed. Also, make it clear on the site otherwise it will be impossible to grade!

ReplyDeleteCan we change our link from http://2012rankmaniac.blogspot.com/ to 2012rankmaniac.wordpress.com ? We migrated.

ReplyDeleteThe TAs: http://rankmaniac.caltech.edu

ReplyDeleteFor question 4 it says to use the first cut PageRank algorithm (alpha=1). Doesn't this algorithm only work for aperiodic graphs? Are we supposed to assume the graph is aperiodic?

ReplyDeleteGood point. The iterative algorithm itself will not converge unless the graph is aperiodic. However, the stationary equations will yield a unique solution so long as the graph is connected. So you can pretend that we define PageRank based on the solution of the stationary equation \pi = \pi P.

DeleteFor question 2 is it ok to use a program like Mathematica to solve the eigenvalue equation or to diagonalize the matrix?

ReplyDeleteYes, you can diagonalize the transition matrix using Mathematica/Matlab.

DeleteFor the individual report, do we have to detail what other members have done?

ReplyDeleteOr can we focus on what we ourselves have done?

DeleteNever mind; it's just one report for the whole group. I misread that.

DeleteIn Problem 4, in the definition of betweenness centrality, what is meant by "shortest paths"?

ReplyDeleteThe `shortest paths' connecting two nodes is simply the set of all paths connecting those nodes that have the smallest possible hop length.

DeleteNote that there could be more than one path with the smallest possible hop length.

Token policy for HW4: The token policy for individual submissions will be the same. Suppose the group report was submitted 'k' days late and among the group members, the individual submission that was submitted most late was submitted 'm' days late. Then for the lateness of the group report, max{k-m, 0} tokens will be charged. It is your responsibility to indicate on the group report, which team members' tokens should be used for this purpose.

ReplyDeleteWhy: This is the most fair policy I could think of to resolve the problem. It is subject to review by Adam and could change :)

Makes sense to me Raga.

Deletewhat time is class tomorrow?

ReplyDeleteI don't think there is a class today?

DeletePlease note the Guru on the top right of the homework, and send your email submissions to him. Thanks.

ReplyDeleteI don't think our team has asked for a link from the course website. The URL is:

ReplyDeletehttp://www.ugcs.caltech.edu/~snails/rankmaniac/2012/images.html

Done.

Delete