Shuyang Gong

According to our database, Shuyang Gong authored at least 6 papers between 2023 and 2025.

Collaborative distances:

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

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