Shuyang Gong

According to our database, Shuyang Gong authored at least 9 papers between 2023 and 2026.

Collaborative distances:

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

2026

Stable algorithms cannot reliably find isolated perceptron solutions.

Shuyang Gong, Brice Huang, Shuangping Li, Mark Sellke

CoRR, April, 2026

Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models.

Shuyang Gong, Dong Huang, Zhangsong Li

CoRR, February, 2026

Detecting Correlation Efficiently in Very Supercritical Stochastic Block Models: Breaking the Otter's Threshold Barrier.

Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

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

A Proof of The Changepoint Detection Threshold Conjecture in Preferential Attachment Models.

Hang Du, Shuyang Gong, Jiaming Xu

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

2024

A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs.

Jian Ding, Hang Du, Shuyang Gong

Random Struct. Algorithms, 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

The Algorithmic Phase Transition of Random Graph Alignment Problem.

Hang Du, Shuyang Gong, Rundong Huang

CoRR, 2023