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
Showing math.STShow all

3 papers · 1 filter

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.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.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…