Monday, January 30, 2012

Homework 4

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!

36 comments:

  1. 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.

    ReplyDelete
  2. myrankmanic2012.blogspot.com

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

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

      http://myrankmaniac2012.blogspot.com/

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

      Delete
  3. http://rankmaniac-2012.caltech.edu

    Yay! Rankmaniac 2012!

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

    Also, 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?

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

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

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

    PS: It's on my rankmaniac page ;)

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

      Delete
  6. I 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

    ReplyDelete
  7. Here's our page:
    http://2012rankmaniac.blogspot.com/

    ReplyDelete
  8. Rankmaniac 2012 Music Festival!

    http://rankmaniac2012.wordpress.com/

    ReplyDelete
    Replies
    1. The group members are Kevin Lo, Nathan Watson, and Mikhail Sushkov

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

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

    ReplyDelete
  10. Our page:
    http://2012rankmaniac.caltech.edu

    Thanks!

    ReplyDelete
  11. 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!

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

    ReplyDelete
  13. The TAs: http://rankmaniac.caltech.edu

    ReplyDelete
  14. For 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?

    ReplyDelete
    Replies
    1. Good 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.

      Delete
  15. For question 2 is it ok to use a program like Mathematica to solve the eigenvalue equation or to diagonalize the matrix?

    ReplyDelete
    Replies
    1. Yes, you can diagonalize the transition matrix using Mathematica/Matlab.

      Delete
  16. For the individual report, do we have to detail what other members have done?

    ReplyDelete
    Replies
    1. Or can we focus on what we ourselves have done?

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

      Delete
  17. In Problem 4, in the definition of betweenness centrality, what is meant by "shortest paths"?

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

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

      Delete
  18. 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.

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

    ReplyDelete
  19. what time is class tomorrow?

    ReplyDelete
    Replies
    1. I don't think there is a class today?

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

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

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

    ReplyDelete