Settling the Sharp Reconstruction Thresholds of Random Graph Matching-Reference-Cited by-同舟云学术

Settling the Sharp Reconstruction Thresholds of Random Graph Matching

Author:

Wu Yihong¹^ORCID,Xu Jiaming²^ORCID,Yu Sophie H.²^ORCID

Affiliation:

1. Department of Statistics and Data Science, Yale University, New Haven, CT, USA

2. The Fuqua School of Business, Durham, NC, USA

Funder

NSF

NSF CAREER

Alfred Sloan Fellowship

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

Reference26 articles.

1. Spectral graph matching and regularized quadratic relaxations II: Erd?s-Rényi graphs and universality;fan;arXiv 1907 08883,2019

2. Spectral alignment of graphs;feizi;arXiv 1602 04181,2016

3. Sharp threshold for alignment of graph databases with Gaussian weights;ganassali;Proc 22nd Annu Conf Math Sci Mach Learn,2021

4. From tree matching to sparse graph alignment;ganassali;Proc Conf Learn Theory,2020

5. Impossibility of partial recovery in the graph alignment problem;ganassali;Proc Conf Learn Theory,2021

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Attributed Graph Alignment;IEEE Transactions on Information Theory;2024-08

5. Privacy Leakage In Graph Signal To Graph Matching Problems;ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2024-04-14