Consistent polynomial-time unseeded graph matching for Lipschitz graphons
arXiv:1807.11027
Abstract
We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be significantly easier than its worst case counterpart, well-known to be NP-hard, the statistical version of the problem has stood a challenge that resisted any solution both provable and polynomial-time. The closest existing work requires quasi-polynomial time. Our method is based on the latest advances in graphon estimation techniques and analysis on the concentration of empirical Wasserstein distances. Its core is a simple yet unconventional sampling-and-matching scheme that reduces the problem from unseeded to seeded. Our method allows flexible efficiencies, is convenient to analyze and potentially can be extended to more general settings. Our work enables a rich variety of subsequent estimations and inferences.
arXiv comment13 pages
References in corpus (16)
- Matrix estimation by Universal Singular Value Thresholding
- Graph Isomorphism in Quasipolynomial Time
- Rate-optimal graphon estimation
- Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
- Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spaces
- Seeded graph matching for correlated Erdős-Rényi graphs
- A Survey on Theoretical Advances of Community Detection in Networks
- A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference
- Geometric Network Comparison
- Network Representation Using Graph Root Distributions
- Fast Change Point Detection on Dynamic Social Networks
- Why are Big Data Matrices Approximately Low Rank?
- Linear Programming Heuristics for the Graph Isomorphism Problem
- Unseeded low-rank graph matching by transform-based unsupervised point registration
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Tractable Graph Matching via Soft Seeding