应用数学漫谈.pptVIP

应用数学漫谈 Nevanlinna Prize（2006)Jon Kleinberg Page Rank, the ranking system used by the Google search engine. Query independent content independent. using only the web graph structure Page Rank, the ranking system used by the Google search engine. 数学是很有用的，今天我们该讨论的是数学如何使用，而不是数学有没有用的问题，数学需要的是近一步的发展和推进。 * * 核工业 C-T扫描仪 人造地球卫星等等 Google搜索与Inter网的信息检索 数学建模的经典案例 约有307,000 项符合南阳师范学院的查询结果，以下是第1-20项。(搜索用时 0.10秒） How can google make a ranking of 307,000 pages in 0.10 seconds? A main task of Internet (Web) Information Retrieval  = Design and Analysis of Search Engine (SE) Algorithm involving plenty of mathematics ? HITS ? PageRank 1998 Jon Kleinberg Cornell University Sergey Brin and Larry Page Stanford University One of Kleinberg’s most important research achievements focuses on the internetwork structure of the World Wide Web. Prior to　Kleinberg‘s work, search engines focused only on the content of web pages，not on the link structure. Kleinberg introduced the idea of “authorities” and “hubs”: An authority is a web page that rmation on a particular topic, and a hub is a page that contains links to　many authorities. The example of web graph structure 这恰好可以看成一个网络点击浏览过程 PageRank as a Function of the Damping Factor Paolo Boldi Massimo Santini Sebastiano Vigna DSI, Università degli Studi di Milano WWW 2005 paper 3.1 Choosing the damping factor 3 General Behaviour 3.2 Getting close to 1 can we somehow characterise the properties of ? what makes different from the other (infinitely many, if P is reducible) limit distributions of P? is the limit distribution of P when the starting distribution is uniform, that is, Conjecture 1 : 欢迎各位参加到全国大学生数学建模竞赛中来 *