OmniMatch provably and asymptotically perfectly aligns unseeded vertices across independent random dot product graphs using only a seed set and shared latent structure, with no edge correlation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)
OmniMatch provably and asymptotically perfectly aligns unseeded vertices across independent random dot product graphs using only a seed set and shared latent structure, with no edge correlation.