Zhangsong Li
Welcome to my homepage!
I am a second-year Ph.D student in School of Mathematical Sciences at Peking University, where I was fortunate to be advised by Jian Ding. Previously, I obtained my B.S. degree in mathematics from Peking University.
My research interest lies in the intersection of probability, high-dimensional statistics and theoretical computer science.
Links: Google Scholar.
Email address: ramblerlzs at pku dot edu dot cn.
Research
- A computational transition for detecting multivariate shuffled linear regression by low-degree polynomials
Zhangsong Li
[arXiv]
- Detecting correlation efficiently in stochastic block models: breaking Otter's threshold by counting decorated trees
Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li
[arXiv]
- Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs
Zhangsong Li
[arXiv]
- Robust random graph matching in dense graphs via vector approximate message passing
Zhangsong Li
[arXiv]
- A computational transition for detecting correlated stochastic block models by low-degree polynomials
Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li
[arXiv]
- The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
Shuyang Gong, Zhangsong Li
[arXiv]
- Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
Jian Ding, Hang Du, Zhangsong Li
to appear in Annals of Statistics
[arXiv]
- A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
Jian Ding, Zhangsong Li
[arXiv]
- A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
Jian Ding, Zhangsong Li
Foundations of Computational Mathematics, online 2024
[arXiv] [Journal]
Talks
- Recent progress on random graph matching problems. Tsinghua University, March 2025, Beijing, China.
- Low-degree hardness of detection for correlated Erdős-Rényi graphs. Tsinghua Sanya International Mathematics Forum, January 2024, Sanya, China.
- A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation. Peking University, June 2023, Beijing, China.
Teaching Assistant
Probability Theory, Spring 2025.
Advanced Probability Theory, Fall 2024.
Applied Stochastic Process (Honor), Fall 2023.