The paper characterizes exact and partial recovery thresholds in the featured correlated Gaussian Wigner model and proposes the QPAlign quadratic programming algorithm with theoretical guarantees.
Wein, and Shenduo Zhang
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Sharp conditions for exact recovery of general planted subgraphs in ER graphs are given by the minimal maximum subgraph density, with matching bounds, a spectral algorithm, and computational hardness results via low-degree polynomials.
citing papers explorer
-
Attributed Network Alignment: Statistical Limits and Efficient Algorithm
The paper characterizes exact and partial recovery thresholds in the featured correlated Gaussian Wigner model and proposes the QPAlign quadratic programming algorithm with theoretical guarantees.
-
Recovery of Planted Subgraphs
Sharp conditions for exact recovery of general planted subgraphs in ER graphs are given by the minimal maximum subgraph density, with matching bounds, a spectral algorithm, and computational hardness results via low-degree polynomials.