21 citations · 68 across the 5 of their papers we have counts for
10 papers
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…
Optimal Rates for Estimation of Two-Dimensional Totally Positive Distributions
Jan-Christian Hütter, Cheng Mao, Philippe Rigollet +1
We study minimax estimation of two-dimensional totally positive distributions. Such distributions pertain to pairs of strongly positively dependent random variables and appear freq…
Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality
Zhou Fan, Cheng Mao, Yihong Wu +1
We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edg…
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Zhou Fan, Cheng Mao, Yihong Wu +1
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally in…
Estimation of Monge Matrices
Jan-Christian Hütter, Cheng Mao, Philippe Rigollet +1
Monge matrices and their permuted versions known as pre-Monge matrices naturally appear in many domains across science and engineering. While the rich structural properties of such…
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations
Cheng Mao, Ashwin Pananjady, Martin J. Wainwright
Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on it…