81 citations · 673 across the 80 of their papers we have counts for
84 papers
Uniqueness of the critical long-range percolation metrics
Jian Ding, Zherui Fan, Lu-Jing Huang
In this work, we study the random metric for the critical long-range percolation on . A recent work by Bäumler [3] implies the subsequential scaling limit, and our ma…
One-arm exponent of critical level-set for metric graph Gaussian free field in high dimensions
Zhenhao Cai, Jian Ding
In this paper, we study the critical level-set of Gaussian free field (GFF) on the metric graph . We prove that the one-arm probability (i.e. the prob…
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
Jian Ding, Zhangsong Li
We propose an efficient algorithm for matching two correlated Erdős--Rényi graphs with vertices whose edges are correlated through a latent vertex correspondence. When the edge…
On the prevalence of the periodicity of maximizing measures
Jian Ding, Zhiqiang Li, Yiwei Zhang
For a continuous map on a compact metric space , we say that a function has the property if its time averag…
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…