337 citations · 1.6k across the 34 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
stat.ML2018★ 21 cited
Efficient random graph matching via degree profiles
Jian Ding, Zongming Ma, Yihong Wu +1
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs a…
math.ST2018★ 6 cited
Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing
Chao Gao, Zongming Ma
This paper surveys some recent developments in fundamental limits and optimal algorithms for network analysis. We focus on minimax optimal rates in three fundamental problems of ne…
math.ST2018★ 5 cited
Asymptotic normality and analysis of variance of log-likelihood ratios in spiked random matrix models
Debapratim Banerjee, Zongming Ma
The present manuscript studies signal detection by likelihood ratio tests in a number of spiked random matrix models, including but not limited to Gaussian mixtures and spiked Wish…