Zhangsong Li

According to our database, Zhangsong Li authored at least 10 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation.

Jian Ding, Zhangsong Li

Found. Comput. Math., August, 2025

A computational transition for detecting multivariate shuffled linear regression by low-degree polynomials.

Zhangsong Li

CoRR, April, 2025

Detecting correlation efficiently in stochastic block models: breaking Otter's threshold by counting decorated trees.

Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li

CoRR, March, 2025

Robust random graph matching in Gaussian models via vector approximate message passing.

Zhangsong Li

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random Graphs.

Zhangsong Li

Proceedings of the Approximation, 2025

2024

Robust random graph matching in dense graphs via vector approximate message passing.

Zhangsong Li

CoRR, 2024

A computational transition for detecting correlated stochastic block models by low-degree polynomials.

Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li

CoRR, 2024

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime.

Shuyang Gong, Zhangsong Li

CoRR, 2024

2023

Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs.

Jian Ding, Hang Du, Zhangsong Li

CoRR, 2023

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation.

Jian Ding, Zhangsong Li

CoRR, 2023