Speaker: Gong Shuyang, Peking University

Date: March 26, 2025

Time: 15:30-17:00 pm

Location: C717, Mingde Building, Shandong University

Sponsor: School of Mathematics, Shandong University

Abstract:

In this talk, I will discuss recent progress in two areas of combinatorial statistics: random graph matching und changepoint detection. For the graph matching problem, I will present results from both the information-theoretic and computational perspectives, focusing on three graph models: correlated Erdős-Rényi random graphs, geometric graphs, and a novel computational phenomenon in stochastic block models. Turning to the changepoint detection problem, I will focus on the classical preferential attachment model and describe both positive and negative results. This talk is based on joint work with Guanyi Chen (PKU), Jian Ding (PKU), Hang Du (MIT), Rundong Huang (PKU to NUS), Zhangsong Li and Jiaming Xu (Duke).

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/200396.htm