Mathematics Colloquium: From Perron-Frobenius to Google PageRank
4:10 pm, Neill Hall 5W
Abstract: The Perron-Frobenius Theorem marks the start of 100 years of fruitful interaction between combinatorics and matrix theory. Among its many applications, the Perron-Frobenius Theorem provides a foundation for schemes for ranking players in tournaments and candidates in elections. More recently, the Perron-Frobenius Theorem has been employed in various web searching engines. In this talk, I will explain how graph- theoretic ideas have given power to what was originally an analytic result, and why many ranking schemes naturally lead us to need the Perron-Frobenius Theorem.