Conference: Contemporary Combinatorics 2011

会议：当代组合学 2011

• 批准号: 1134511
• 负责人: Bela Bollobas
• 金额: $ 2.09万
• 依托单位: University of Memphis
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2011
• 资助国家: 美国
• 起止时间: 2011-04-15 至 2012-03-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1134511&HistoricalAwards=false
• 关键词: Conference; Contemporary; Combinatorics; 2011

The aim of this conference is to bring together a group of outstanding mathematicians who work on topics related to combinatorics, understood in the widest sense. Invited speakers will address a diverse set of topics including graph theory, Ramsey theory, operation research, theoretical computer science, probabilistic combinatorics, simplicial complexes, biostatistics and bioinformatics. The meeting will provide an opportunity for mathematicians from the Mid-South to benefit not only from the lectures but also from personal contacts with the speakers. The main speaker is Jon Kleinberg from Cornell University. A popular lecturer, he has done great work on networks and is particularly well known for his HITS algorithm, an algorithm for web search that builds on the eigenvector-based methods used by many commercial search engines. Kleinberg is also known for his work on algorithmic aspects of the small world experiment. Among other honors, he received a MacArthur Foundation Fellowship in 2005 and the Nevanlinna Prize in 2006, an award that is given out once every four years along with the Fields Medal; it is the premier distinction in Computational Mathematics. His most recent book, entitled Networks, Crowds, and Markets: Reasoning About a Highly Connected World, was published by Cambridge University Press in 2010.Two lectures will be aimed at a general audience and high school students from the best schools in the Memphis area will be invited to attend. In the first lecture, Joel Spencer will give a contextual talk positioning Erdos as one of the most significant mathematicians of the 20th century. In the second lecture, Kleinberg will focus on questions related to flow of information through networks, emphasizing mathematical models for information flow in human social networks and their reflections in the on-line world.

这次会议的目的是聚集一群杰出的数学家，他们研究与最广泛意义上的组合学相关的主题。受邀演讲者将讨论各种主题，包括图论、拉姆齐理论、运筹学、理论计算机科学、概率组合学、单纯复形、生物统计学和生物信息学。 这次会议将为中南地区的数学家提供一个机会，他们不仅可以从讲座中受益，还可以从与演讲者的个人接触中受益。 主讲人是来自康奈尔大学的 Jon Kleinberg。作为一名受欢迎的讲师，他在网络方面做了出色的工作，尤其以其 HITS 算法而闻名，这是一种基于许多商业搜索引擎使用的基于特征向量的方法构建的网络搜索算法。 克莱因伯格还因其在小世界实验的算法方面的工作而闻名。 除其他荣誉外，他还于 2005 年获得了麦克阿瑟基金会奖学金，并于 2006 年获得了内万林纳奖（该奖项与菲尔兹奖一起每四年颁发一次）；这是计算数学领域的首要区别。 他的最新著作《网络、人群和市场：推理高度互联的世界》于 2010 年由剑桥大学出版社出版。两场讲座将针对普通观众和来自孟菲斯地区最好学校的高中生将受邀出席。在第一场讲座中，乔尔·斯宾塞 (Joel Spencer) 将进行情境演讲，将鄂尔多斯定位为 20 世纪最重要的数学家之一。在第二场讲座中，克莱因伯格将重点讨论与网络信息流相关的问题，强调人类社交网络中信息流的数学模型及其在网络世界中的反映。