报告时间： 2017年5月3日（周三）下午14:00 

报告地点： 尚贤楼108报告厅 

报告题目：Counting vertices in labeled rooted trees 

报 告 人： Prof. Miklos Bona 

报告简介：Various parameters of many models of random rooted trees are fairly well understood if they relate to a near-root part of the tree or to global tree structure. In recent years there has been a growing interest in the analysis of the random tree fringe, that is, the part of the tree that is close to the leaves. Distance from the closest leaf can be viewed as the protection level of a vertex, or the seniority of a vertex within a network. In this talk we will review a few recent results of this kind for a number of tree varieties, as well as indicate the challenges one encounters when trying to generalize the existing results. One tree variety, that of decreasing binary trees, will be related to permutations, another one, phylogenetic trees, is frequent in applications in molecular biology. 

专家简介： Bona教授毕业于麻省理工学院，导师是组合学大师Stanley教授。Bona教授现任 教于美国Florida大学，主要研究方向为组合学、概率论、计算机科学、生物数学 等。