Next Article in Journal
An Integrative Dynamic Model of Colombian Population Distribution, Based on the Maximum Entropy Principle and Matter, Energy, and Information Flow
Previous Article in Journal
Entropy and Information Theory: Uses and Misuses
Previous Article in Special Issue
On the Optimality of Interference Decoding Schemes for K-User Gaussian Interference Channels
Open AccessArticle

A Strong Converse Theorem for Hypothesis Testing Against Independence over a Two-Hop Network

1
School of Information Science and Engineering, Southeast University, Nanjing 210000, China
2
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA
3
Department of Electrical and Computer Engineering and Department of Mathematics, National University of Singapore, Singapore 119077, Singapore
*
Author to whom correspondence should be addressed.
This paper was partially presented at ISIT 2019, Paris, France, 7–12 July 2019.
Entropy 2019, 21(12), 1171; https://doi.org/10.3390/e21121171
Received: 29 October 2019 / Revised: 18 November 2019 / Accepted: 28 November 2019 / Published: 29 November 2019
(This article belongs to the Special Issue Multiuser Information Theory II)
By proving a strong converse theorem, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by combining two recently-proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verdú (2017) and the strong converse technique by Tyagi and Watanabe (2018), in which the authors used a change-of-measure technique and replaced hard Markov constraints with soft information costs. The techniques used in our paper can also be applied to prove strong converse theorems for other multiterminal hypothesis testing against independence problems.
Keywords: strong converse; hypothesis testing with communication constraints; testing against independence; two-hop network; relay strong converse; hypothesis testing with communication constraints; testing against independence; two-hop network; relay
MDPI and ACS Style

Cao, D.; Zhou, L.; Tan, V.Y.F. A Strong Converse Theorem for Hypothesis Testing Against Independence over a Two-Hop Network. Entropy 2019, 21, 1171.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop