Partial graph alignment is feasible exactly on vertices whose balanced load in the intersection graph exceeds the self-overlap of the union graph, giving sharp thresholds for Chung–Lu and stochastic block-model graphs.
Title resolution pending
1 Pith paper cite this work, alongside 19 external citations. Polarity classification is still indexing.
1
Pith paper citing it
19
external citations · OpenAlex
fields
math.PR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graph alignment in sparse inhomogeneous models via self-overlap
Partial graph alignment is feasible exactly on vertices whose balanced load in the intersection graph exceeds the self-overlap of the union graph, giving sharp thresholds for Chung–Lu and stochastic block-model graphs.