Sharp Informational Thresholds for Fundamental Questions in Correlated Random Graph Model

Topic: 
Sharp Informational Thresholds for Fundamental Questions in Correlated Random Graph Model
Date & Time: 
Thursday, May 4, 2023 - 16:00 to 17:00
Speaker: 
Hang Du, Peking University
Location: 
W923, NYU Shanghai New Bund Campus & Hosted via Zoom

- RSVP Here -

Abstract:

In this talk, I will introduce the correlated graph model and talk about informational thresholds for fundamental questions like correlation detection and (partial) matching recovery. These thresholds are established by new insights on connections between the correlated graph model and  the densest subgraph problem in sparse Erdős–Rényi Graphs. This talk is based on joint works with Jian Ding (PKU).

Biography:

Hang Du is an undergraduate student at School of Mathematical Sciences, Peking University. He will graduate in July, 2023, and afterwards he will pursue the Ph.D degree in Mathematics at MIT.

Seminar by the NYU-ECNU Institute of Mathematical Sciences at NYU Shanghai