A peeling algorithm for multiple testing on a random field

DOI10.1007/s00180-017-0724-4zbMath1417.65042OpenAlexW2601823993MaRDI QIDQ1695540

Donghyeon Yu, Joong-Ho Won, Joungyoun Kim, Johan Lim

Publication date: 7 February 2018

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-017-0724-4

zbMATH Keywords

functional MRIhidden Markov random fieldmarginal false discovery ratelocal index of significance

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Inference from spatial processes (62M30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Paired and multiple comparisons; multiple testing (62J15)

Cites Work

• Unnamed Item
• Unnamed Item
• Probability functions on complex pedigrees
• Graph searching and a min-max theorem for tree-width
• Monotone false discovery rate
• Size, power and false discovery rates
• Multiple testing for neuroimaging via hidden Markov random field
• Large-Scale Multiple Testing under Dependence
• Asymptotically efficient parameter estimation in hidden Markov spatio-temporal random fields
• A hidden Markov random field model for genome-wide association studies
• Oracle and Adaptive Compound Decision Rules for False Discovery Rate Control
• The optimal power puzzle: scrutiny of the monotone likelihood ratio assumption in multiple testing
• Statistical Inference for Probabilistic Functions of Finite State Markov Chains
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Monte Carlo strategies in scientific computing

This page was built for publication: A peeling algorithm for multiple testing on a random field