Random graph matching at Otter's threshold via counting chandeliers

  title={Random graph matching at Otter's threshold via counting chandeliers},
  author={Cheng Mao and Yihong Wu and Jiaming Xu and Sophie H. Yu},
We propose an efficient algorithm for graph matching based on similarity scores constructed from counting a certain family of weighted trees rooted at each vertex. For two Erdős–Rényi graphs G(n, q) whose edges are correlated through a latent vertex correspondence, we show that this algorithm correctly matches all but a vanishing fraction of the vertices with high probability, provided that nq →∞ and the edge correlation coefficient ρ satisfies ρ > α ≈ 0.338, where α is Otter’s tree-counting… 

Figures and Tables from this paper

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation

This work proposes an iterative matching algorithm, which succeeds in polynomial time as long as the correlation between the two Gaussian matrices does not vanish.



Random Graph Matching with Improved Noise Robustness

This work proposes a new algorithm for graph matching that associates each vertex with a signature vector using a multistage procedure and then matches a pair of vertices from the two graphs if their signature vectors are close to each other.

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

This work proves the universality of the exact recovery guarantees established for Gaussian weights for a general correlated Wigner model, and shows that GRAMPA exactly recovers the latent vertex correspondence with high probability when $\sigma \lesssim 1/\operatorname{polylog}(n)$.

On the performance of percolation graph matching

A very simple percolation - based graph matching algorithm that incrementally maps every pair of nodes (i,j) with at least r neighboring mapped pairs is proposed and analyzed, which makes possible a rigorous analysis that relies on recent advances in bootstrappercolation theory for the G(n,p) random graph.

Settling the Sharp Reconstruction Thresholds of Random Graph Matching

It is proved that there exists a sharp threshold, above which one can correctly match all but a vanishing fraction of vertices and below which correctly matching any positive fraction is impossible, a phenomenon known as the “all-or-nothing” phase transition.

Efficient random graph matching via degree profiles

This work develops an O ~ ( n d 2 + n 2 ) -time algorithm which perfectly recovers the true vertex correspondence with high probability, provided that the average degree is at least d = \varOmega (\log ^2 n) and the two graphs differ by at most d = O ( log - 2 ( n) ) fraction of edges.

Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis

It is shown that GRAMPA exactly recovers the correct vertex correspondence with high probability when σ = O( 1 logn ), which matches the state of the art of polynomial-time algorithms, and significantly improves over existing spectral methods which require σ to be polynomially small in n.

Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs

This work identifies a region in which a straightforward $\calO(n^11/5 łog n )$-time canonical labeling algorithm succeeds in aligning correlated Erdős-Rényi graphs and shows that the implementation of a variant of this algorithm allows for the efficient alignment of large graphs under limited noise.

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

The information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resources, is investigated and a converse bound is provided, establishing conditions underwhich exact recovery is impossible.

Testing for high‐dimensional geometry in random graphs

The proof of the detection lower bound is based on a new bound on the total variation distance between a Wishart matrix and an appropriately normalized GOE matrix and a conjecture for the optimal detection boundary is made.

Matching recovery threshold for correlated random graphs

A sharp information-theoretic threshold is established for whether it is possible to correctly match a positive fraction of vertices in a correlated graph G ( n, p).