The HITS algorithm provides a framework for analyzing web search by identifying nodes as either hubs or authorities, a development originated by Jon Kleinberg while working at the IBM Almaden Research Center. This contribution remains central to the study of network structures and search engine methodology, marking his career as a computer scientist.
Academic Background
Born in Boston in 1971, Kleinberg is the son of Evelyn Kleinberg, a computer science researcher, and Eugene Kleinberg, a mathematics professor at SUNY Buffalo. His educational trajectory included a Bachelor of Science degree in computer science from Cornell University, which he earned in 1993. Subsequently, he completed his Doctor of Philosophy at the Massachusetts Institute of Technology in 1996. He has served as a professor in the Department of Computer Science at Cornell University and holds the title of Tisch University Professor of Computer Science and Information Science.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Network Research and Small World Theory
Kleinberg expanded on Stanley Milgram's experimental work regarding social networks and the observation of short paths between individuals. He established a formal model using a d-dimensional grid to analyze how people identify these paths, noting that long-range connections decay in probability based on the distance between nodes. His research defines how structure influences connectivity in social networks.
Publications and Professional Standing
His academic output includes the textbook Algorithm Design, which he co-authored with Éva Tardos. In 2010, Cambridge University Press published his book titled Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Kleinberg is a member of the American Academy of Arts and Sciences, the National Academy of Sciences, and the National Academy of Engineering. He maintains associations with the Association for Computing Machinery and has participated as a visiting scientist at IBM.
Awards and Recognition
Throughout his career, Kleinberg has received numerous honors for his contributions to computer science. These include the 1996 Machtey Award and the 2001 William O. Baker Award for Initiatives in Research. In 2005, he received a MacArthur Foundation Fellowship. He was awarded the IMU Abacus Medal in 2006, followed by the Frederick W. Lanchester Prize in 2011. Further recognition includes the Harvey Prize in 2013 and the ACM-AAAI Allen Newell Award in 2014. Additionally, he was named an ACM Fellow in 2013.
Fast facts
- Born: 1971, Boston
- Citizenship: United States
- Academic degrees: BS, Cornell University; PhD, Massachusetts Institute of Technology
- Current employer: Cornell University
- Key research area: Algorithms and networks
- MacArthur Fellow: 2005
- IMU Abacus Medal recipient: 2006
- ACM Fellow: 2013
Questions readers ask
What is the primary focus of Jon Kleinberg's research?
He specializes in algorithms and networks, specifically investigating web search methodologies and the mathematical structures of social connections.
Which institutions have employed Jon Kleinberg?
He has held positions at Cornell University since 1996 and has served as a visiting scientist at IBM's Almaden Research Center.
Achievements
- Harvey Prize — 2013
- IMU Abacus Medal — 2006
- ACM Prize in Computing — 2008
- Frederick W. Lanchester Prize — 2011
- Held posts at Cornell University
