Error exponents for composite hypothesis testing of Markov forest distributions

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 o...

Full description

Bibliographic Details
Main Authors: Tan, Vincent Yan Fu (Contributor), Anandkumar, Animashree (Contributor), Willsky, Alan S. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2012-10-03T19:16:37Z.
Subjects:
Online Access:Get fulltext