activity
20222026
most citedA polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs

1 citations · 3 across the 11 of their papers we have counts for

collaborators

14 papers

math.PR2026

Free energy fluctuations of symmetric perceptron models up to and including criticality

Hang Du, Shuyang Gong, Brice Huang +1

We study the free energy fluctuations of spherical and Ising perceptron models with general even activations. These include the symmetric binary perceptron, the -perceptron, and…

math.PR2026

Strong freezing in binary perceptron models

Shuyang Gong, Shuangping Li

The binary perceptron model concerns the set of solutions obtained by intersecting random half-spaces. One of the most striking physics predictions for this model, going back to Kr…

math.PR2026

The Conclave Process

Itai Benjamini, Zhenhao Cai, Guanyi Chen +2

We introduce a stochastic model for the papal conclave in which cardinals vote repeatedly among themselves until one cardinal receives all the votes. In each round, the probabi…

cs.CC2026

Stable algorithms cannot reliably find isolated perceptron solutions

Shuyang Gong, Brice Huang, Shuangping Li +1

We study the binary perceptron, a random constraint satisfaction problem that asks to find a Boolean vector in the intersection of independently chosen random halfspaces. A strikin…

math.ST2026

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

Shuyang Gong, Dong Huang, Zhangsong Li

We consider the problem of community detection from the joint observation of a high-dimensional covariate matrix and sparse networks, all encoding noisy, partial information ab…

math.PR2025★ 1 cited

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms

Shankar Bhamidi, David Gamarnik, Shuyang Gong

We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applica…

math.ST2025

Detection and Reconstruction of a Random Hypergraph from Noisy Graph Projection

Shuyang Gong, Zhangsong Li, Qiheng Xu

For a -uniform random hypergraph on vertices in which hyperedges are included i.i.d.\ so that the average degree in the hypergraph is , the projection of such a…

math.PR2025

Asymptotic diameter of preferential attachment model

Hang Du, Shuyang Gong, Zhangsong Li +1

We study the asymptotic diameter of the preferential attachment model with parameters and . Building on the recent work \cite{VZ25},…

cs.DS2025

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime

Guanyi Chen, Jian Ding, Shuyang Gong +1

Consider a pair of sparse correlated stochastic block models subsampled from a common parent stochastic block model with two symmetric communities, a…

math.PR2025

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

Hang Du, Shuyang Gong, Jiaming Xu

We investigate the problem of detecting and estimating a changepoint in the attachment function of a network evolving according to a preferential attachment model on vertices,…

math.PR2024

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

Guanyi Chen, Jian Ding, Shuyang Gong +1

Detection of correlation in a pair of random graphs is a fundamental statistical and computational problem that has been extensively studied in recent years. In this work, we consi…

math.ST2024★ 1 cited

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

Shuyang Gong, Zhangsong Li

Motivated by the problem of matching two correlated random geometric graphs, we study the problem of matching two Gaussian geometric models correlated through a latent node permuta…

math.PR2023

The Algorithmic Phase Transition of Random Graph Alignment Problem

Hang Du, Shuyang Gong, Rundong Huang

We study the graph alignment problem over two independent Erdős-Rényi graphs on vertices, with edge density falling into two regimes separated by the critical window around…

math.PR2022★ 1 cited

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

Jian Ding, Hang Du, Shuyang Gong

For two independent Erdős-Rényi graphs , we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence…