A strong converse theorem for hypothesis testing against independence over a two-hop network

Abstract

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 prooffollows by combining two recently-proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verdu (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 sof t 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. © 2019 The Author(s).