加入收藏  || English Version 
 
美国西弗吉尼亚大学Eddie Fuller和罗荣教授学术报告

  发布日期:2016-03-19  浏览量:483


学术报告一

报告题目: EB+D and SQCM Clustering of Signed Networks

: Eddie Fuller 教授(美国西弗吉尼亚大学数学系主任)

    要:Clustering algorithms for unsigned networks which have only positive edges have been studied intensively. However, many networks arise in situations where relationships are best expressed by both positive and negative values and in such situations unsigned networks with only positive edges are inadequate. Currently, there are few clustering algorithms for signed networks due to the fact that such algorithms not only require the clusters of a signed network to be dense (as required in the unsigned case), but also that there should be as many negative edges as possible between clusters. In this talk we will discuss signed network clustering for signed networks and two approaches to clustering where both the betweenness of edges and the density of subgraphs are considered. A hierarchically nested system is constructed to illustrate the inclusion relationships of clusters. We will describe some results using several classical social networks and hundreds of synthetic data sets.

报告时间: 20163 23(周三)下午14:30-15:30

报告地点: 磬苑校区澳门赌搏网站大全H306

学术报告二

报告题目: Density and spanning trees of A-connected graphs

: 罗荣 教授(美国西弗吉尼亚大学)

    要:Let A be an Abelian group. It is known that an A-connected graph cannot be very sparse. We study the extremal problem: find the maximum integer k, denoted ex(n, A), such that every graph with at most k edges is not A-connected. We determine the exact values for all finite cyclic groups. As a corollary, we present a characterization of all Z_k-connected graphic sequences. It is also known that there are Z_5-connected graph that are not Z_6-connected. We prove that every Z_3-connected graph contains two edge-disjoint spanning trees, which implies that every Z_3-connected graph is also A-connected for any A with order at least 4. 

报告时间: 20163 23(周三)下午15:40-16:40

报告地点: 磬苑校区澳门赌搏网站大全H306

欢迎各位老师、同学届时前往!

                                                                                                     澳门赌搏网站大全

                                                                                                     2016319

报告人概况一: Eddie Fuller, 美国西弗吉尼亚大学(West Virginia UniversityUSA)数学系系主任,教授, IEEE会员。University of Georgia博士,主要研究方向包括微分几何学,数学教育,数据挖掘和生物信息。长期主持NASA 美国NSF 项目。

报告人概况二: 罗荣,美国西弗吉尼亚大学(West Virginia UniversityUSA)数学系教授。主要研究图的染色理论和流的理论,是国际知名的染色问题专家。发表近50余篇论文,多数是发表在图论顶尖杂志如Journal of Cominatorial Theory Ser. B, Journal of Graph Theory, SIAM Journal on Discrete Math, and European J. of Combinatorics. Vizing上世纪60年代末提出的四个关于边染色的猜想取得了一系列突破性进展。 解决了几个著名公开问题如ErdosGould Jacobson以及 Lehel 提出的一个关于可图序列猜想,Borodin 提出的边面染色的问题,以及Archdeacon 关于三流可图序列的问题。

打印此页】【顶部】【关闭
   
版权所有 2019 澳门赌搏网站大全 All rights reserved 皖ICP备05018241号
地址:安徽省合肥市九龙路111号澳门新莆京娱乐网站磬苑校区理工楼H楼 邮编:230601 E-mail:math@ahu.edu.cn
访问统计:自2013年9月1日以来总访问:1000  后台管理


XML 地图 | Sitemap 地图