1 citations · 3 across the 11 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
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…
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},…
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,…
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…
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…
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…