Jon Kleinberg's work perfectly fits the Nevanlinna Prize specification since, as we have seen, his mathematical insights have had wide application to multiple elements of information science-the effectiveness of advanced Web search engines, Internet routing, data mining, and the sociology of the World Wide Web. We refer the interested reader to his website  for further pointers to papers on these and other topics, including network analysis and management, gossip algorithms, clustering, data mining, comparative genomics, and geometric pattern matching. Returning to our opening theme, Kleinberg's much-lauded work on information networks is characterized by (i) identifying and formulating fundamental mathematical structures in questions about the real world, (ii) defining meaningful mathematical models that represent crucial features of real-world phenomena, and finally (iii) creating effective algorithms that solve the resulting mathematical problems.
|Original language||English (US)|
|Number of pages||4|
|Journal||Notices of the American Mathematical Society|
|State||Published - Jun 2007|
ASJC Scopus subject areas