Probability Theory
Shuyang Gong 巩舒阳
FDS Postdoctoral Fellow · Yale University
Hello! Welcome to my homepage!
I am an FDS postdoctoral fellow at the Institute for Foundations of Data Science, Yale University, hosted by Prof. Daniel A. Spielman. Previously, I obtained my Ph.D. degree in probability and mathematical statistics at the School of Mathematical Sciences, Peking University, where I was advised by Prof. Dayue Chen and Prof. Jian Ding. I obtained my B.S. degree in statistics from the Department of Mathematics, Shandong University.
My research interest is probability theory. My Erdős Number is 3.
Emailfirstname dot lastname at yale dot edu gongsyprob at gmail dot com
Selected research
All research →Positions & education
FDS Postdoctoral Fellow
Yale University
Institute for Foundations of Data Science · Host: Prof. Daniel A. Spielman
Department of Statistics and Data Science, Yale University
Ph.D. in Probability and Mathematical Statistics
Peking University
School of Mathematical Sciences · Advisors: Prof. Dayue Chen and Prof. Jian Ding
B.S. in Statistics
Shandong University
Department of Mathematics
Shuyang Gong · Research
Research
My research interest is probability theory.
Preprints
-
Preprint2026
-
Preprint2026
-
Preprint2025
-
Preprint2024
Publications
-
FOCS 2026to appear
Stable algorithms cannot reliably find isolated perceptron solutions
Conference version to appear at FOCS 2026
-
ECP 2026
Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
Electronic Communications in Probability
-
ISIT 2026
Detection and reconstruction of a random hypergraph from noisy graph projection
IEEE International Symposium on Information Theory (ISIT 2026)
-
ECP 2026
Asymptotic diameter of preferential attachment model
Electronic Communications in Probability
-
SODA 2026
Detecting correlation efficiently in very supercritical stochastic block models: breaking the Otter’s threshold barrier
ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)
-
COLT 2025AAP, to appear
A proof of the changepoint detection threshold conjecture in preferential attachment models
Conference on Learning Theory (COLT 2025). Journal version to appear at Annals of Applied Probability
Best Poster Award at the 2026 Joint Workshop of RMTA & SNAB
-
AoS 2026
-
PTRF 2025
The algorithmic phase transition of random graph alignment problem
Probability Theory and Related Fields
-
RSA 2024
A polynomial-time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs
Random Structures and Algorithms
Shuyang Gong · Talks
Talks
2026
-
Stable algorithms cannot reliably find isolated perceptron solutions
Probability and Stochastic Analysis seminar, Chinese Academy of Sciences · Beijing, China
-
Stable algorithms cannot reliably find isolated perceptron solutions
Shanghai Center for Mathematical Sciences, Fudan University · Shanghai, China
2025
-
Phase transitions in statistical models: several examples
Shandong University · Jinan, China
-
A proof of the changepoint detection threshold conjecture in preferential attachment models
COLT 2025 · Lyon, France
-
A proof of the changepoint detection threshold conjecture in preferential attachment models
An International Conference on Applied Probability · Beijing, China
-
Asymptotic diameter of preferential attachment model
YMSC probability seminar, Tsinghua University · Beijing, China · joint with Zhangsong Li
-
Combinatorial Statistics: recent progress on random graph alignment and changepoint detection
Shandong University · Jinan, China
2024
-
Matching Wishart matrices via Umeyama algorithm
Peking University · Beijing, China
-
Optimizing the overlap of two independent Erdős–Rényi graphs
Probability seminar, Sichuan University · Chengdu, China
2023
-
Algorithms and phase transitions in random graph alignment problem
Peking University · Beijing, China
-
On cluster expansion and its applications into Ising model—spontaneous magnetization and exponential decay of truncated two-point function in sufficiently low temperature regime
Peking University · Beijing, China
2022
-
A polynomial-time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs
Zhongtai Securities Institute for Financial Studies, Shandong University · online
2020
-
An introduction to first-passage percolation
Zhongtai Securities Institute for Financial Studies, Shandong University · Jinan, China
Shuyang Gong · Teaching
Teaching
- Spring 2025
Calculus (B) Notes ↗
- Spring 2024
- Fall 2023
Advanced Probability Theory
- Spring 2023
Measure Theory
- Spring & Fall 2022
Stochastic Processes
- Fall 2021