Title: Nodal Domain Partition and Community Structure in Networks

Keynote Speaker: Zhang Xiaodong

Abstract: It is difficult to detect and evaluate the number of communities in complex networks, especially when the situation involves an ambiguous boundary between the inner- and inter-community densities. In this paper, Discrete Nodal Domain Theory is used to provide a criterion to determine how many communities a network has and how to partition these communities by means of the topological structure and geometric characterization. By capturing the signs of the Laplacian eigenvectors, we separate the network into several reasonable clusters. The method leads to a fast and effective algorithm with application to a variety of real networks data sets.

Speaker Introduction: Zhang Xiaodong, professor, doctoral supervisor. In June 1998, he received his Doctor of Science from the University of Science and Technology of China; worked on post-doctoral research at the Israel Institute of Technology (funded by the Lady Davis Postdoctoral fellowship) and University of Chile, and visiting scholar at UCSD of University of California; presided over the projects of Natural Science Foundation of China and participated in the 973 and 863 national project; won the second prize of Anhui Science and Technology Progress Award and the third prize of Science and Technology Progress of the Ministry of Education; published over 100 papers in SCI journals and a monograph; served as the vice chairman of Graph Theory and Combinatorics Branch of Operations Research Society of China. At present, he mainly studies random graph and complex network, spectral graph theory, combinatorial matrix theory, etc.

Inviter: Wu Jianliang, professor of School of Mathematics

Time: 16:00, May 16 (Thursday)

Location: Hall 924, Block B, Zhixin Building, Central Campus

Hosted by: School of Mathematics, Shandong University