Efficiently matching random inhomogeneous graphs via degree profiles

16 October 2023

Papers citing "Efficiently matching random inhomogeneous graphs via degree profiles"

13 / 13 papers shown

Title
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs Dong Huang Xianwen Song Pengkun Yang 68 2 0 08 Jun 2024
Robust Point Matching with Distance Profiles Y. Hur Y. Khoo 90 0 0 19 Dec 2023
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation Jian Ding Zhang Li 62 13 0 01 Jun 2023
A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation Jian Ding Zhang Li 46 7 0 28 Dec 2022
Random graph matching at Otter's threshold via counting chandeliers Cheng Mao Yihong Wu Jiaming Xu Sophie H. Yu 69 41 0 25 Sep 2022
Matching recovery threshold for correlated random graphs Jian Ding Hangyu Du 53 25 0 29 May 2022
Random Graph Matching in Geometric Models: the Case of Complete Graphs Haoyu Wang Yihong Wu Jiaming Xu Israel Yolou 66 29 0 22 Feb 2022
Testing network correlation efficiently via counting trees Cheng Mao Yihong Wu Jiaming Xu Sophie H. Yu 49 36 0 22 Oct 2021
Exact Matching of Random Graphs with Constant Correlation Cheng Mao M. Rudelson K. Tikhomirov 54 41 0 11 Oct 2021
Testing correlation of unlabeled random graphs Yihong Wu Jiaming Xu Sophie H. Yu 47 36 0 23 Aug 2020
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs Boaz Barak Chi-Ning Chou Zhixian Lei T. Schramm Yueqi Sheng 27 65 0 07 May 2018
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel Tai Qin Karl Rohe 129 303 0 16 Sep 2013
Consistency of community detection in networks under degree-corrected stochastic block models Yunpeng Zhao Elizaveta Levina Ji Zhu 213 427 0 18 Oct 2011