Biography
Dr. Yilun Shang
Dr. Yilun Shang
Department of Computer and Information Sciences,Northumbria University, China
Title: Super connectivity of random graphs and its applications in network security
Abstract: 
The super connectivity κ′(G) of a graph G is the minimum cardinality of vertices, if any, whose deletion results in a disconnected graph that contains no isolated vertex. G is said to be r-super connected if κ′(G)≥r . In this talk, we discuss some recent asymptotic almost-sure convergence results on r-super connectedness for some random graphs (including Erdos-Renyi random graphs and Kronecker random graphs) when the number of nodes tends to infinity. We will briefly discuss some applications in communication network defense protocols.
Biography: 
Yilun Shang is currently an Associate Professor (Reader) and the Program Leader for MSC in Artificial Intelligence at Northumbria University. He received his PhD degree in Mathematics from Shanghai Jiao Tong University in 2010. His main research interests include graph theory, network theory, probability, nonlinear system, and distributed algorithm. He is a recipient of the Dimitrie Pompeiu Prize in 2016 and the 2019 Outstanding Associate Editor Award of IEEE Access. He is an invited reviewer for Mathematical Reviews.