9 citations · 15 across the 8 of their papers we have counts for
9 papers
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…
Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
Xuan Chen, Shuangping Li
The low-degree heuristic has become a widely used framework for predicting computational thresholds in average-case planted-versus-null problems. However, a recent sequence of coun…
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…
Detection of local geometry in random graphs: information-theoretic and computational limits
Jinho Bok, Shuangping Li, Sophie H. Yu
We study the problem of detecting local geometry in random graphs. We introduce a model , where a hidden community of average size has edges drawn as a…
Spectral clustering in the Gaussian mixture block model
Shuangping Li, Tselil Schramm
Gaussian mixture block models are distributions over graphs that strive to model modern networks: to generate a graph from such a model, we associate each vertex with a latent…
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…
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…
Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold
Emmanuel Abbe, Shuangping Li, Allan Sly
The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the recent years in sparser regimes. Yet…
A Trace Theorem For Sobolev Spaces On The Sierpinski Gasket
Shiping Cao, Shuangping Li, Robert S. Strichartz +1
We give a discrete characterization of the trace of a class of Sobolev spaces on the Sierpinski gasket to the bottom line. This includes the L2 domain of the Laplacian as a special…