56 citations · 225 across the 37 of their papers we have counts for
11 papers · 1 filter
Applications of Royen's Gaussian Correlation Inequality in high-dimensional testing
Jiashun Jin, Zheng Tracy Ke, Jingming Wang
Royen's Gaussian Correlation Inequality (GCI) is a fundamental result in statistics and probability, but unfortunately, at least by now, the result is not very well known in the st…
Network Goodness-of-Fit for the block-model family
Jiashun Jin, Zheng Tracy Ke, Jiajun Tang +1
The block-model family has four popular network models (SBM, DCBM, MMSBM, and DCMM). A fundamental problem is, how well each of these models fits with real networks. We propose GoF…
Phase transition for detecting a small community in a large network
Jiashun Jin, Zheng Tracy Ke, Paxton Turner +1
How to detect a small community in a large network is an interesting problem, including clique detection as a special case, where a naive degree-based -test was shown to be po…
Power Enhancement and Phase Transitions for Global Testing of the Mixed Membership Stochastic Block Model
Louis Cammarata, Zheng Tracy Ke
The mixed-membership stochastic block model (MMSBM) is a common model for social networks. Given an -node symmetric network generated from a -community MMSBM, we would like t…
Optimal Network Membership Estimation Under Severe Degree Heterogeneity
Zheng Tracy Ke, Jingming Wang
Real networks often have severe degree heterogeneity, with the maximum, average, and minimum node degrees differing significantly. This paper examines the impact of degree heteroge…
Power of Knockoff: The Impact of Ranking Algorithm, Augmented Design, and Symmetric Statistic
Zheng Tracy Ke, Jun S. Liu, Yucong Ma
The knockoff filter is a recent false discovery rate (FDR) control method for high-dimensional linear models. We point out that knockoff has three key components: ranking algorithm…
Optimal Adaptivity of Signed-Polygon Statistics for Network Testing
Jiashun Jin, Zheng Tracy Ke, Shengming Luo
Given a symmetric social network, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree het…
A Sharp Lower Bound for Mixed-membership Estimation
Jiashun Jin, Zheng Tracy Ke
Consider an undirected network with nodes and perceivable communities, where some nodes may have mixed memberships. We assume that for each node , there is…
Detecting Rare and Weak Spikes in Large Covariance Matrices
Zheng Tracy Ke
Given -dimensional Gaussian vectors , , where , we are interested in testing a null hypothesis where agains…
Phase Transitions for High Dimensional Clustering and Related Problems
Jiashun Jin, Zheng Tracy Ke, Wanjie Wang
Consider a two-class clustering problem where we observe , , . The feature vector is unknown bu…
Discussion: "A significance test for the lasso"
Jianqing Fan, Zheng Tracy Ke
Discussion of "A significance test for the lasso" by Richard Lockhart, Jonathan Taylor, Ryan J. Tibshirani, Robert Tibshirani [arXiv:1301.7161].