Packet 1: Bonus 18
Cornell professor Jon Kleinberg developed the HITS algorithm for this task, which ascribes a “hub value” and an “authority” to each object. For 10 points each:
[10m] Name this task whose most well-known algorithm models a “random surfer” and incorporates backlinks into its central scoring scheme.
ANSWER: page ranking [or link analysis or page sorting or relevance weighting]
[10e] The “random surfer” in Google’s PageRank algorithm is modelled by one of these memoryless stochastic processes, which are constructed in a class of Monte Carlo methods for random sampling.
ANSWER: Markov chains [or Markov processes; accept Markov chain Monte Carlo methods; prompt on MCMC]
[10h] Kleinberg’s HITS algorithm and PageRank are derived from analysis of these items. A lower bound on the number of these items is the defining value of a metric developed by Jorge E. Hirsch in 2005.
ANSWER: citations [or cites or references; accept citation analysis] (The metric is the h-index.)
<Editors, Other Science> | U. Finals 1 (Editors 11)
| Heard | PPB | E % | M % | H % |
|---|---|---|---|---|
| 1 | 10.00 | 100% | 0% | 0% |
Conversion
| Team | Opponent | Part 1 | Part 2 | Part 3 | Total | Parts |
|---|---|---|---|---|---|---|
| Stanford A | Chicago A | 0 | 10 | 0 | 10 | E |
Summary
| Tournament | Edition | Match | Heard | PPB | E % | M % | H % |
|---|---|---|---|---|---|---|---|
| Main Site | 2026-04-17 | ✓ | 1 | 10.00 | 100% | 0% | 0% |