Search Results for author:
Found 4 papers, 0 papers with code
Random graph matching at Otter's threshold via counting chandeliers
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.
Testing network correlation efficiently via counting trees
We propose a new procedure for testing whether two networks are edge-correlated through some latent vertex correspondence.
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs.
Testing correlation of unlabeled random graphs
We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
