1 citations · 2 across the 5 of their papers we have counts for
12 papers
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…
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…
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…
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…
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…
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},…