3 citations · 7 across the 7 of their papers we have counts for
Showing 2022 · math.PRShow all
2 papers · 2 filters
math.PR2022★ 1 cited
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…
math.PR2022
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,…