9 citations · 15 across the 8 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2026
Graph Matching in Random Geometric Graphs I: Efficient Algorithms
Dong Huang, Ankang Jiao, Shuangping Li +1
We study the recovery of the hidden vertex correspondence between two correlated dense random geometric graphs. Each graph is generated from latent unit vectors in $\mathbb R^d…
math.PR2021★ 1 cited
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
Emmanuel Abbe, Shuangping Li, Allan Sly
It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard…
math.PR2021★ 9 cited
Mean Field Behavior during the Big Bang Regime for Coalescing Random Walks
Jonathan Hermon, Shuangping Li, Dong Yao +1
In this paper we consider coalescing random walks on a general connected graph . We set up a unified framework to study the leading order of the decay rate of , the e…