Error exponents for composite hypothesis testing of Markov forest distributions
Name
Willsky_Erroe exponents.pdf
Size
197.8 KB
Format
Adobe PDF
Checksum (MD5)
a3499f32d30687db7354b54d4447bdcc
Author(s) • •
Tan, Vincent Yan Fu
Anandkumar, Animashree
Willsky, Alan S.
Date Issued
July 2010
Journal
Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Tan, Vincent Y. F., Animashree Anandkumar, and Alan S. Willsky. “Error Exponents for Composite Hypothesis Testing of Markov Forest Distributions.” IEEE International Symposium on Information Theory Proceedings (ISIT), 2010. 1613–1617. © Copyright 2010 IEEE
Version
Final published version
Abstract
The problem of composite binary hypothesis testing of Markov forest (or tree) distributions is considered. The worst-case type-II error exponent is derived under the Neyman-Pearson formulation. Under simple null hypothesis, the error exponent is derived in closed-form and is characterized in terms of the so-called bottleneck edge of the forest distribution. The least favorable distribution for detection is shown to be Markov on the second-best max-weight spanning tree with mutual information edge weights. A necessary and sufficient condition to have positive error exponent is derived.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2010.5513399