演讲人: 美国南卡罗纳大学数学系陆临渊(Lu Linyuan)副教授

讲座时间: 12月2 日(周五)9:30-10:30

讲座地点: 信息楼127室

讲座内容:

Abstract:

In this first part of the talk, we consider a random subgraph $G_p$ of

a host graph $G$ formed by retaining each edge of $G$ with probability

$p$. We address the question of determining the critical value $p$

(as a function of $G$) for which a giant component emerges,

provided $G$ has a small spectral bound on Laplacian.

In the second part of the talk, we generalize Laplacians to hypergraphs and

study the Laplacians of random hypergraphs.

(Joint work with Fan Chung, Paul Horn, and Xing Peng.)

陆临渊教授先后就读于南开大学，美国UPenn和UCSD，并于2002年获得博士学位。研究领域为极值图论、随机图和复杂网络。他为Journal of Combinatorics 杂志责任编辑。他与博士导师著名谱图理论专家Fan Chung Graham教授合作的著作“Complex graphs and networks”中提出的一些概念在复杂网络界得到广泛的应用。陆临渊教授的网页请见：http://www.math.sc.edu/~lu/