Papers › A Graph Signal Processing Perspective of Network Multiple Hypothesis Testing with...
A Graph Signal Processing Perspective of Network Multiple Hypothesis Testing with False Discovery Rate Control
Xingchao Jian, Martin Gölz, Feng Ji, Wee Peng Tay, Abdelhak M. Zoubir
We consider a multiple hypothesis testing problem in a sensor network over the joint spatio-temporal domain. The sensor network is modeled as a graph, with each vertex representing a sensor and a signal over time associated with each vertex. We assume a hypothesis test and an associated p-value for every sample point in the joint spatio-temporal domain. Our goal is to determine which points have true alternative. By parameterizing the unknown p-value distribution under the alternative and the prior probabilities of hypotheses being null with a bandlimited generalized graph signal, we can obtain consistent estimates for them. Consequently, we also obtain an estimate of the local false discovery rates (lfdr). We prove that by using a step-up procedure on the estimated lfdr, we can achieve asymptotic false discovery rate control at a pre-determined level. Numerical experiments validate the effectiveness of our approach compared to existing methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections