Analytic and Probabilistic Combinatorics, and Long Cycles in Graphs

分析和概率组合学以及图中的长周期

• 批准号: RGPIN-2015-04010
• 负责人: Gao, Zhicheng
• 金额: $ 1.02万
• 依托单位: Carleton University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2015
• 资助国家: 加拿大
• 起止时间: 2015-01-01 至 2016-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=589533
• 关键词: Analytic; Probabilistic; Combinatorics; Long; Cycles

With the explosion of data in our information age, we need to deal with discrete structures of ever-growing size. Analytic and probabilistic combinatorics is a branch of discrete mathematics which uses tools from analysis and probability theory to study the properties of large discrete structures. Also graphs serve as very useful models for many discrete structures arising from applications. In this proposal I address some specific problems in analytic and probabilistic combinatorics, and graph theory.

随着信息时代的数据爆炸， 我们需要处理不断增长的离散结构。分析和概率组合学是离散数学的一个分支，它使用分析和概率论的工具来研究大型离散结构的性质。此外，图作为非常有用的模型，许多离散结构所产生的应用。 在这个建议中，我解决了分析和概率组合学以及图论中的一些具体问题。