3 citations · 7 across the 7 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023★ 3 cited
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…
math.PR2023
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…
math.PR2023★ 1 cited
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…