3 citations · 4 across the 14 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
stat.ML2024
Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm
Zhangsong Li
In this paper, we focus on the matching recovery problem between a pair of correlated Gaussian Wigner matrices with a latent vertex correspondence. We are particularly interested i…
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…