NSF/CBMS Regional Research Conference in Mathematical Sciences on The Combinatorics of Large Sparse Graphs; June 7 - June 12, 2004; CSUSM

NSF/CBMS 大型稀疏图组合数学科学区域研究会议；

• 批准号: 0332519
• 负责人: Radhika Ramamurthi
• 金额: $ 3.13万
• 依托单位: California State University San Marcos Corporation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2003
• 资助国家: 美国
• 起止时间: 2003-11-15 至 2004-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0332519&HistoricalAwards=false
• 关键词: NSF; CBMS; Regional; Research; Conference

In recent years an important area of research has been that of phenomena that can be represented by large complex networks. These networks arise naturally in many settings, for example, the Internet, the network of telephone calls made, the connection of neurons in the brain, the power grid structure in a country, social networks of acquaintances and various other situations. Tools from the area of Combinatorics have been used extensively to study the properties of these networks with the view of discovering and analyzing their hidden structures.An NSF-CBMS Regional Research Conference titled "The Combinatorics of Large Sparse Graphs" is proposed to be held at California State University San Marcos from June 7 to June 12, 2004 with Professor Fan Chung Graham, a leading authority in this area as the principal speaker. The aim of the conference is to present a unified theory of the research on large sparse networks. We expect that the many applications of the area and the richness of the problems will attract both experts and beginners, especially graduate students, in all areas of discrete mathematics and theoretical computer science.

近年来，一个重要的研究领域是可以用大型复杂网络表示的现象。这些网络在许多环境中自然出现，例如互联网、电话网络、大脑中神经元的连接、国家的电网结构、熟人的社交网络以及各种其他情况。组合学领域的工具已被广泛用于研究这些网络的属性，以发现和分析其​​隐藏结构。建议在2004年6月7日至12日在加州州立大学圣马科斯分校举行，由该领域权威人士Fan Chung Graham教授作为主讲人。 会议的目的是提出大型稀疏网络研究的统一理论。我们预计该领域的众多应用和问题的丰富性将吸引离散数学和理论计算机科学所有领域的专家和初学者，特别是研究生。