81 citations · 673 across the 80 of their papers we have counts for
7 papers · 1 filter
A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
Jian Ding, Zhangsong Li
Motivated by the problem of matching vertices in two correlated Erdős-Rényi graphs, we study the problem of matching two correlated Gaussian Wigner matrices. We propose an iterativ…
A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs
Jian Ding, Hang Du, Shuyang Gong
For two independent Erdős-Rényi graphs , we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence…
Long range order for three-dimensional random field Ising model throughout the entire low temperature regime
Jian Ding, Yu Liu, Aoteng Xia
For , we study the Ising model on with random field given by where 's are independent normal variables with mean 0 and vari…
Shotgun threshold for sparse Erdős-Rényi graphs
Jian Ding, Yiyang Jiang, Heng Ma
In the shotgun assembly problem for a graph, we are given the empirical profile for rooted neighborhoods of depth (up to isomorphism) for some and we wish to recover…
Matching recovery threshold for correlated random graphs
Jian Ding, Hang Du
For two correlated graphs which are independently sub-sampled from a common Erdős-Rényi graph , we wish to recover their \emph{latent} vertex matching from the ob…
Shotgun assembly threshold for lattice labeling model
Jian Ding, Haoyu Liu
We study the shotgun assembly problem for the lattice labeling model, where i.i.d. uniform labels are assigned to each vertex in a -dimensional box of side length . We wish t…