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.
Optimal recovery of correlated Erd˝ os-R´ enyi graphs.arXiv preprint arXiv:2502.12077
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Develops a tree-correlation algorithm for diffusion-network alignment with high-probability correctness guarantees and explicit depth-dependent probability bounds in sparse graphs.
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.
-
Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds
Develops a tree-correlation algorithm for diffusion-network alignment with high-probability correctness guarantees and explicit depth-dependent probability bounds in sparse graphs.