3 citations · 7 across the 7 of their papers we have counts for
7 papers
Optimal Spectral Algorithms for Correlated Two-view Models in High Dimensions
Hang Du, Henry Hu, Saba Lepsveridze
We study high-dimensional inference in correlated two-view models, focusing on spectral methods for strong detection and weak recovery. We introduce a general framework, motivated…
Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
Jian Ding, Hang Du, Zhangsong Li
Given two Erdős-Rényi graphs with vertices whose edges are correlated through a latent vertex correspondence, we study complexity lower bounds for the associated correlation de…
The Algorithmic Phase Transition of Random Graph Alignment Problem
Hang Du, Shuyang Gong, Rundong Huang
We study the graph alignment problem over two independent Erdős-Rényi graphs on vertices, with edge density falling into two regimes separated by the critical window around…
Percolation threshold for metric graph loop soup
Yinshan Chang, Hang Du, Xinyi Li
In this short note, we show that the critical threshold for the percolation of metric graph loop soup on a large class of transient metric graphs (including quasi-transitive graphs…
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…
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…
Detection threshold for correlated Erdős-Rényi graphs via densest subgraphs
Jian Ding, Hang Du
The problem of detecting edge correlation between two Erdős-Rényi random graphs on unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis,…