返回
DETECTION THRESHOLDS FOR THE β-MODEL ON SPARSE GRAPHS
DOI:10.1214/17-AOS1585.png)
摘要
En 中文
In this paper, we study sharp thresholds for detecting sparse signals in beta-models for potentially sparse random graphs. The results demonstrate interesting interplay between graph sparsity, signal sparsity and signal strength. In regimes of moderately dense signals, irrespective of graph sparsity, the detection thresholds mirror corresponding results in independent Gaussian sequence problems. For sparser signals, extreme graph sparsity implies that all tests are asymptotically powerless, irrespective of the signal strength. On the other hand, sharp detection thresholds are obtained, up to matching constants, on denser graphs. The phase transitions mentioned above are sharp. As a crucial ingredient, we study a version of the higher criticism test which is provably sharp up to optimal constants in the regime of sparse signals. The theoretical results are further verified by numerical simulations.
Keyword:
Detection boundary
sparse random graphs
beta model
higher criticism
sparse signals
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
<p align="left">A new species of Postia (Polyporales, Basidiomycota) from China based on morphological and molecular evidence
Phytotaxa
IF0
INNOVATED HIGHER CRITICISM FOR DETECTING SPARSE SIGNALS IN CORRELATED NOISE
ANNALS OF STATISTICS
IF3.7

