Noninteractive correlation distillation, inhomogeneous Markov chains, and the reverse BonamiBeckner inequality
 Elchanan Mossel,
 Ryan O'Donnell,
 Oded Regev,
 Jeffrey E. Steif,
 Benny Sudakov
 … show all 5 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
In this paper we studynoninteractive correlation distillation (NICD), a generalization of noise sensitivity previously considered in [5, 31, 39]. We extend the model toNICD on trees. In this model there is a fixed undirected tree with players at some of the nodes. One node is given a uniformly random string and this string is distributed throughout the network, with the edges of the tree acting as independent binary symmetric channels. The goal of the players is to agree on a shared random bit without communicating.
Our new contributions include the following:
• In the case of akleaf star graph (the model considered in [31]), we resolve the open question of whether the success probability must go to zero ask » ∞. We show that this is indeed the case and provide matching upper and lower bounds on the asymptotically optimal rate (a slowlydecaying polynomial).
• In the case of thekvertex path graph, we show that it is always optimal for all players to use the same 1bit function.
• In the general case we show that all players should use monotone functions. We also show, somewhat surprisingly, that for certain trees it is better if not all players use the same function.
Our techniques include the use of thereverse BonamiBeckner inequality. Although the usual BonamiBeckner has been frequently used before, its reverse counterpart seems not to be well known. To demonstrate its strength, we use it to prove a new isoperimetric inequality for the discrete cube and a new result on the mixing of short random walks on the cube. Another tool that we need is a tight bound on the probability that a Markov chain stays inside certain sets; we prove a new theorem generalizing and strengthening previous such bounds [2, 3, 6]. On the probabilistic side, we use the “reflection principle” and the FKG and related inequalities in order to study the problem on general trees.
 Abramowitz, M., Stegun, I. (1972) Handbook of Mathematical Functions. Dover, New York
 M. Ajtai, J. Komolós and E. Szemerédi,Deterministic simulation in LOGSPACE, inProceedings of the 19th Annual ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 132–140.
 Alon, N., Feige, U., Wigderson, A., Zuckerman, D. (1995) Derandomized graph products, Computational Complexity. Birkhäuser, Basel
 Alon, N., Kalai, G., Ricklin, M., Stockmeyer, L. (1994) Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theoretical Computer Science 130: pp. 175201 CrossRef
 N. Alon, U. Maurer and A. Wigderson, Unpublished results, 1991.
 Alon, N., Spencer, J. (2000) The Probabilistic Method. Wiley, New York
 Amano, K., Maruoka, A. (2002) On learning monotone Boolean functions under the uniform distribution. Springer, New York
 Beckner, W. (1975) Ineqalities in Fourier analysis. Annals of Mathematics 102: pp. 159182 CrossRef
 BenOr, M., Linial, N. In: Micali, S. eds. (1990) Collective coin flipping. Academic Press, New York
 Benjamini, I., Kalai, G., Schramm, O (1999) Noise sensitivity of boolean functions and applications to percolation. Publications Mathématiques de l'Institut des Hautes Études Scientifiques 90: pp. 543 CrossRef
 Bobkov, S., Götze, F. (1999) Discrete isoperimetric, and Poincarétype inequalities. Probability theory and Related Fields 114: pp. 245277 CrossRef
 Bonami, A. (1970) Études des coefficients Fourier des fonctiones de Lp (G). Annales de l'Institut Fourier 20: pp. 335402
 Borell, C. (1982) Positivity improving operators and hypercontractivity. Mathematische Zeitschrift 180: pp. 225234 CrossRef
 Bourgain, J. (1999) An appendix toSharp thresholds of graph properties, and the ksat problem. Journal of the American Mathematical Society 12: pp. 10171054 CrossRef
 Bourgain, J., Kahn, J., Kalai, G., Katznelson, Y., Linial, N. (1992) The influence of variables in product spaces. Israel Journal of Mathematics 77: pp. 5564
 Bourgain, J., Kalai, G. (1997) Influences of variables and threshold intervals under group symmetries. Geometric and Functional Analysis 7: pp. 438461 CrossRef
 N. Bshouty, J. Jackson and C. Tamon,Uniformdistribution attribute noise learnability, inProceedings of the Eighth Annual Conference on Computational Learning Theory, (COLT 1995), Santa Cruz, California, USA, ACM, 1995.
 I. Dinur, V. Guruswami and S. Khot,Vertex cover on kuniform hypergraphs is hard to approximate within factor (k3∈), ECCC Technical Report TRO2027, 2002.
 I. Dinur and S. Safra,The importance of being biased, inProceedings of the 34th Annual ACM Symposium on the Theory of Computing, ACM, New York, 2002, pp. 33–42.
 Feller, W. (1968) An Introduction to Probability Theory and its Applications. Wiley, New York
 Fortuin, C., Kasteleyn, P., Ginibre, J. (1971) Correlation inequalities on some partially ordered sets. Communications in Mathematical Physics 22: pp. 89103 CrossRef
 Friedgut, E. (1998) Boolean functions with low average sensivity depend on few coordinates. Combinatorica 18: pp. 474483 CrossRef
 Friedgut, E., Kalai, G. (1996) Every monotone graph property has a sharp threshold. Proceedings of the American Mathematical Society 124: pp. 29933002 CrossRef
 Georgii, H. O. (1988) Gibbs Measures and Phase Transitions. de Gruyter, Berlin
 G. Hardy, J. Littlewood and G. Póyla,Inequalities, 2nd edn., Cambridge University Press, 1952.
 H»stad, J. (2001) Some optimal inapproximability results. Journal of the ACM 48: pp. 798869 CrossRef
 Kahn, J., Kalai, G., Linial, N. (1988) The influence of variables on boolean functions. Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 6880
 S. Khot,On the power of unique 2prover 1round games, inProceedings of the 34th Annual ACM Symposium on the Theory of Computing, ACM, New York, 2002, pp. 767–775.
 Kleitman, D. (1966) Families of nondisjoint subsets. Journal of Combinatorial Theory 1: pp. 153155 CrossRef
 Klivans, A., O'Donnell, R., Servedio, R. (2002) Learning intersections and thresholds of halfspaces. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 177186 CrossRef
 Mossel, E., O'Donnell, R. (2005) Coin flipping from a cosmic source: On error correction of truly random bits. Random Structures & Algorithms 26: pp. 418436 CrossRef
 Naor, A., Friedgut, E., Kalai, G. (2002) Boolean functions whose Fourier transform is concentrated on the first two levels. Advances in Applied Mathematics 29: pp. 427437 CrossRef
 R. O'Donnell,Hardness amplification within NP, inProceedings of the 34th Annual ACM Symposium on the Theory of Computing, ACM, New York, 2002, pp. 715–760.
 R. O'Donnell,Computational applications of noise sensitivity, PhD thesis, Massachusetts Institute of Technology, 2003.
 R. O'Donnell and R. Servedio,Learning monotone decision trees, Manuscript, 2004.
 Raz, R. (1995) Fourier analysis for probabilistic communication complexity. Computational Complexity 5: pp. 205221 CrossRef
 Sazonov, V. (1981) Normal Approximation— Some Recent Advances. SpringerVerlag, Berlin
 Talagrand, M. (1994) On Russo's approximate 0–1 law. Annals of Probability 22: pp. 14761387
 Yang, K. On the (im)possibility of noninteractive correlation distillation. In: FarachColton, M. eds. (2004) LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5–8, 2004, Proceedings. Springer, Berlin
 Title
 Noninteractive correlation distillation, inhomogeneous Markov chains, and the reverse BonamiBeckner inequality
 Journal

Israel Journal of Mathematics
Volume 154, Issue 1 , pp 299336
 Cover Date
 20061201
 DOI
 10.1007/BF02773611
 Print ISSN
 00212172
 Online ISSN
 15658511
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 Elchanan Mossel ^{(1)}
 Ryan O'Donnell ^{(2)}
 Oded Regev ^{(3)}
 Jeffrey E. Steif ^{(4)}
 Benny Sudakov ^{(5)}
 Author Affiliations

 1. Department of Statistics, University of California at Berkeley, 94720, Berkeley, CA, USA
 2. School of Mathematics, Institute for Advanced Study, 08540, Princeton, NJ, USA
 3. Department of Computer Science, Tel Aviv University, Ramat Aviv, 69978, Tel Aviv, Israel
 4. Department of Mathematics, Chalmers University of Technology, 41296, Gothenburg, Sweden
 5. Department of Mathematics, Princeton Univeristy, 08544, Princeton, NJ, USA