21 citations · 129 across the 21 of their papers we have counts for
4 papers · 1 filter
Testing network correlation efficiently via counting trees
Cheng Mao, Yihong Wu, Jiaming Xu +1
We propose a new procedure for testing whether two networks are edge-correlated through some latent vertex correspondence. The test statistic is based on counting the co-occurrence…
Exact Matching of Random Graphs with Constant Correlation
Cheng Mao, Mark Rudelson, Konstantin Tikhomirov
This paper deals with the problem of graph matching or network alignment for Erdős--Rényi graphs, which can be viewed as a noisy average-case version of the graph isomorphism probl…
Optimal Spectral Recovery of a Planted Vector in a Subspace
Cheng Mao, Alexander S. Wein
Recovering a planted vector in an -dimensional random subspace of is a generic task related to many problems in machine learning and statistics, such as dicti…
Random Graph Matching with Improved Noise Robustness
Cheng Mao, Mark Rudelson, Konstantin Tikhomirov
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental co…