307 citations · 907 across the 65 of their papers we have counts for
10 papers · 1 filter
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…
Heteroskedastic PCA: Algorithm, Optimality, and Applications
Anru R. Zhang, T. Tony Cai, Yihong Wu
A general framework for principal component analysis (PCA) in the presence of heteroskedastic noise is introduced. We propose an algorithm called HeteroPCA, which involves iterativ…
Optimal estimation of Gaussian mixtures via denoised method of moments
Yihong Wu, Pengkun Yang
The Method of Moments [Pea94] is one of the most widely used methods in statistics for parameter estimation, by means of solving the system of equations that match the population a…
Application of information-percolation method to reconstruction problems on graphs
Yury Polyanskiy, Yihong Wu
In this paper we propose a method of proving impossibility results based on applying strong data-processing inequalities to estimate mutual information between sets of variables fo…
Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits
Yihong Wu, Jiaming Xu
Over the past few years, insights from computer science, statistical physics, and information theory have revealed phase transitions in a wide array of high-dimensional statistical…
Hidden Hamiltonian Cycle Recovery via Linear Programming
Vivek Bagaria, Jian Ding, David Tse +2
We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an -vertex complete graph that needs to be inferred from noisy edge…
Counting Motifs with Graph Sampling
Jason M. Klusowski, Yihong Wu
Applied researchers often construct a network from a random sample of nodes in order to infer properties of the parent network. Two of the most widely used sampling schemes are sub…
Entropy Rate Estimation for Markov Chains with Large State Space
Yanjun Han, Jiantao Jiao, Chuan-Zheng Lee +3
Estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimation. For estimating the Shannon entropy of a distribution on $S…
Estimating the Number of Connected Components in a Graph via Subgraph Sampling
Jason M. Klusowski, Yihong Wu
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Fr…
Statistical and Computational Limits for Sparse Matrix Detection
T. Tony Cai, Yihong Wu
This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational persp…