The minimax separation rate for detecting a planted dense k1 by k2 subgraph in an n1 by n2 bipartite Erdős-Renyi graph is established up to constants under a dense-graph assumption.
Sparsity meets correlation in Gaussian sequence model
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study estimation of an $s$-sparse signal in the $p$-dimensional Gaussian sequence model with equicorrelated observations and derive the minimax rate. A new phenomenon emerges from correlation, namely the rate scales with respect to $p-2s$ and exhibits a phase transition at $p-2s \asymp \sqrt{p}$. Correlation is shown to be a blessing provided it is sufficiently strong, and the critical correlation level exhibits a delicate dependence on the sparsity level. Due to correlation, the minimax rate is driven by two subproblems: estimation of a linear functional (the average of the signal) and estimation of the signal's $(p-1)$-dimensional projection onto the orthogonal subspace. The high-dimensional projection is estimated via sparse regression and the linear functional is cast as a robust location estimation problem. Existing robust estimators turn out to be suboptimal, and we show a kernel mode estimator with a widening bandwidth exploits the Gaussian character of the data to achieve the optimal estimation rate.
citation-role summary
citation-polarity summary
fields
math.ST 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Optimal community detection in dense bipartite graphs
The minimax separation rate for detecting a planted dense k1 by k2 subgraph in an n1 by n2 bipartite Erdős-Renyi graph is established up to constants under a dense-graph assumption.