.png){kind=icon}
返回
Robust Reproducible Network Exploration
.png){kind=icon}
PRE
AI
DOI：10.1080/07350015.2025.2561147.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a novel methodology for discovering the presence of relationships realized as binary time series between variables in high dimension. To make it visually intuitive, we regard the existence of a relationship as an edge connection, and call a collection of such edges a network. Our objective is thus rephrased as uncovering the network by selecting relevant edges, referred to as the network exploration. Our methodology is based on multiple testing for the presence or absence of each edge, designed to ensure statistical reproducibility via controlling the false discovery rate (FDR). In particular, we carefully construct p-variables, and apply the Benjamini-Hochberg (BH) procedure. We show that the BH with our p-variables controls the FDR under arbitrary dependence structure with any sample size and dimension, and has asymptotic power one under mild conditions. The validity is also confirmed by simulations and real data examples.
Keyword:
Bernoulli random graph
E-value
Exploratory data analysis
False discovery rate control
Power
期刊
J
IF:
2.5
论文数:
89
被引数:
0
机构
引用论文
分享收藏A UNIFIED TREATMENT OF MULTIPLE TESTING WITH PRIOR KNOWLEDGE USING THE P-FILTER.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏Large-Scale Mapping and Validation of Escherichia coli Transcriptional Regulation from a Compendium of Expression ProfilesPLoS BiologyOAAI
PLoS BiologyIF0
OAAI分享收藏
查看更多内容