On Non-Interactive Simulation of Joint Distributions

We consider the following non-interactive simulation problem: Alice and Bob observe sequences Xn and Yn, respectively, where ((Xi, Yi)}i=1n are drawn independent identically distributed from P(x, y), and they output U and V, respectively, which is required to have a joint law that is close in total variation to a specified Q(u, v). It is known that the maximal correlation of U and V must necessarily be no bigger than that of X and Y if this is to be possible. Our main contribution is to bring hypercontractivity to bear as a tool on this problem. In particular, we show that if P(x, y) is the doubly symmetric binary source, then hypercontractivity provides stronger impossibility results than maximal correlation. Finally, we extend these tools to provide impossibility results for the k-agent version of this problem.

[1]  Vivek S. Borkar,et al.  Common randomness and distributed control: A counterexample , 2007, Systems & control letters (Print).

[2]  A. Bonami Ensembles $\Lambda (p)$ dans le dual de $D^\infty $ , 1968 .

[3]  H. Witsenhausen ON SEQUENCES OF PAIRS OF DEPENDENT RANDOM VARIABLES , 1975 .

[4]  Venkat Anantharam,et al.  On hypercontractivity and a data processing inequality , 2014, 2014 IEEE International Symposium on Information Theory.

[5]  Elchanan Mossel,et al.  On Reverse Hypercontractivity , 2011, Geometric and Functional Analysis.

[6]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[8]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[9]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[10]  W. Beckner Inequalities in Fourier analysis , 1975 .

[11]  Paul W. Cuff,et al.  Distributed Channel Synthesis , 2012, IEEE Transactions on Information Theory.

[12]  P. Gács,et al.  Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator , 1976 .

[13]  C. Borell Positivity improving operators and hypercontractivity , 1982 .

[14]  Venkat Anantharam,et al.  On hypercontractivity and the mutual information between Boolean functions , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Elchanan Mossel,et al.  A quantitative Gibbard-Satterthwaite theorem without neutrality , 2011, STOC '12.

[16]  Edward Nelson,et al.  Construction of quantum fields from Markoff fields. , 1973 .

[17]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[18]  Venkat Anantharam,et al.  Generating dependent random variables over networks , 2011, 2011 IEEE Information Theory Workshop.

[19]  Abbas El Gamal,et al.  Exact common information , 2014, 2014 IEEE International Symposium on Information Theory.

[20]  Reza Modarres,et al.  Measures of Dependence , 2011, International Encyclopedia of Statistical Science.

[21]  R. Jackson Inequalities , 2007, Algebra for Parents.

[22]  J. Norris Appendix: probability and measure , 1997 .

[23]  Yury Polyanskiy Hypothesis testing via a comparator and hypercontractivity , 2013 .

[24]  Elchanan Mossel,et al.  On Extracting Common Random Bits From Correlated Sources , 2010, IEEE Transactions on Information Theory.

[25]  Maxim Raginsky,et al.  Logarithmic Sobolev inequalities and strong data processing theorems for discrete channels , 2013, 2013 IEEE International Symposium on Information Theory.

[26]  Elchanan Mossel,et al.  Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality , 2004, math/0410560.

[27]  Thomas A. Courtade,et al.  Which Boolean functions are most informative? , 2013, 2013 IEEE International Symposium on Information Theory.

[28]  Paul W. Cuff,et al.  Communication requirements for generating correlated random variables , 2008, 2008 IEEE International Symposium on Information Theory.

[29]  Amin Gohari,et al.  Channel Simulation via Interactive Communications , 2012, IEEE Transactions on Information Theory.

[30]  M. Ledoux,et al.  Logarithmic Sobolev Inequalities , 2014 .

[31]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[32]  A. Bonami Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .