307 citations · 907 across the 65 of their papers we have counts for
7 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…
Sharp regret bounds for empirical Bayes and compound decision problems
Yury Polyanskiy, Yihong Wu
We consider the classical problems of estimating the mean of an -dimensional normally (with identity covariance matrix) or Poisson distributed vector under the squared loss. In…
Optimal prediction of Markov chains with and without spectral gap
Yanjun Han, Soham Jana, Yihong Wu
We study the following learning problem with dependent data: Observing a trajectory of length from a stationary Markov chain with states, the goal is to predict the next st…
The replica-symmetric free energy for Ising spin glasses with orthogonally invariant couplings
Zhou Fan, Yihong Wu
We study a variant of the Sherrington-Kirkpatrick (S-K) spin glass model with external field, where the random symmetric couplings matrix does not consist of i.i.d. entries but is…
Polynomial methods in statistical inference: theory and practice
Yihong Wu, Pengkun Yang
This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to…
The planted matching problem: Sharp threshold and infinite-order phase transition
Jian Ding, Yihong Wu, Jiaming Xu +1
We study the problem of reconstructing a perfect matching hidden in a randomly weighted bipartite graph. The edge set includes every node pair in and each o…
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
Yihong Wu, Jiaming Xu, Sophie H. Yu
This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs. We focus on the Gaussian model where the two graphs are com…