Influences in Mixing Measures
June 2024
Pages 527 - 536
Abstract
The theory of influences in product measures has profound applications in theoretical computer science, combinatorics, and discrete probability. This deep theory is intimately connected to functional inequalities and to the Fourier analysis of discrete groups. Originally, influences of functions were motivated by the study of social choice theory, wherein a Boolean function represents a voting scheme, its inputs represent the votes, and its output represents the outcome of the elections. Thus, product measures represent a scenario in which the votes of the parties are randomly and independently distributed, which is often far from the truth in real-life scenarios. We begin to develop the theory of influences for more general measures under mixing or spectral independence conditions. More specifically, we prove analogues of the KKL and Talagrand influence theorems for Markov Random Fields on bounded degree graphs when the Glauber dynamics mix rapidly. We thus resolve a long standing challenge, stated for example by Kalai and Safra (2005). We show how some of the original applications of the theory of in terms of voting and coalitions extend to these general dependent measures. Our results thus shed light both on voting with correlated voters and on the behavior of general functions of Markov Random Fields (also called "spin-systems") where the Glauber dynamics mixes rapidly.
References
[1]
Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. 2021. Spectral independence in high-dimensional expanders and applications to the hardcore model. SIAM J. Comput., FOCS2021.
[2]
Mitali Bafna, Max Hopkins, Tali Kaufman, and Shachar Lovett. 2022. Hypercontractivity on high dimensional expanders. In STOC. 22, 54th.
[3]
Dominique Bakry, Ivan Gentil, and Michel Ledoux. 2014. Analysis and geometry of Markov diffusion operators. 103, Springer.
[4]
Roland Bauerschmidt and Thierry Bodineau. 2019. A very simple proof of the LSI for high temperature spin systems. Journal of Functional Analysis, 276, 8 (2019), 2582–2588.
[5]
Roland Bauerschmidt and Benoit Dagallier. 2022. Log-Sobolev inequality for near critical Ising models. arXiv preprint arXiv:2202.02301.
[6]
M. Ben-Or and N. Linial. 1990. Collective coin flipping. In Randomness and Computation, S. Micali (Ed.). Academic Press, New York.
[7]
Thierry Bodineau. 2003. Slab percolation for the Ising model. arXiv preprint math/0309300.
[8]
Zongchen Chen, Kuikui Liu, and Eric Vigoda. 2021. Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. 1537–1550.
[9]
GL Columbu, A De Martino, and A Giansanti. 2008. Nature and statistics of majority rankings in a dynamical model of preference aggregation. Physica A: Statistical Mechanics and its Applications, 387, 5-6 (2008), 1338–1344.
[10]
Dario Cordero-Erausquin and Alexandros Eskenazis. 2023. Talagrand’s influence inequality revisited. Analysis & PDE, 16, 2 (2023), 571–612.
[11]
Dario Cordero-Erausquin and Michel Ledoux. 2012. Hypercontractive measures, Talagrand’s inequality, and influences. In Geometric Aspects of Functional Analysis: Israel Seminar 2006–2010. 169–189.
[12]
Dario Cordero-Erausquin and Michel Ledoux. 2012. Hypercontractive Measures, Talagrand’s Inequality, and Influences. In Geometric Aspects of Functional Analysis (Lecture Notes in Mathematics, Vol. 2050).
[13]
Nikhil R Devanur, Subhash A Khot, Rishi Saket, and Nisheeth K Vishnoi. 2006. Integrality gaps for sparsest cut and minimum linear arrangement problems. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. 537–546.
[14]
R. L. Dobrushin and S. B. Shlosman. 1985. Constructive criterion for uniqueness of a Gibbs field. In Statistical Mechanics and dynamical systems, J. Fritz, A. Jaffe, and D. Szasz (Eds.). 10, 347–370.
[15]
Hugo Duminil-Copin, Aran Raoufi, and Vincent Tassion. 2019. Sharp phase transition for the random-cluster and Potts models via decision trees. Annals of Mathematics, 189, 1 (2019), 75–99.
[16]
Charilaos Efthymiou, Thomas P Hayes, Daniel Stefankovic, Eric Vigoda, and Yitong Yin. 2019. Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model. SIAM J. Comput., 48, 2 (2019), 581–643.
[17]
Ronen Eldan, Frederic Koehler, and Ofer Zeitouni. 2022. A spectral condition for spectral gap: fast mixing in high-temperature Ising models. Probability theory and related fields, 182, 3-4 (2022), 1035–1051.
[18]
Richard S Ellis. 2006. Entropy, large deviations, and statistical mechanics. 1431, Taylor & Francis.
[19]
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, and David Zuckerman. 2019. Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions. arXiv preprint arXiv:1902.07426.
[20]
Serge Galam. 1997. Rational group decision making: A random field Ising model at T= 0. Physica A: Statistical Mechanics and its Applications, 238, 1-4 (1997), 66–80.
[21]
Christophe Garban and Jeffrey E Steif. 2014. Noise sensitivity of Boolean functions and percolation. 5, Cambridge University Press.
[22]
William V Gehrlein. 2006. Condorcet’s paradox. Springer.
[23]
Benjamin T Graham and Geoffrey R Grimmett. 2006. Influence and sharp-threshold theorems for monotonic measures. Annals of probability, 34, 5 (2006), 1726–1745.
[24]
Tom Gur, Noam Lifshitz, and Siqi Liu. 2022. Hypercontractivity on high dimensional expanders. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. 176–184.
[25]
O. Häggström, G. Kalai, and E. Mossel. 2006. A Law of Large Numbers for Weighted Majority. Advances in Applied Mathematics, 37, 1 (2006), 112–123. http://front.math.ucdavis.edu/0406.5509
[26]
Brian C Hall. 2013. Lie groups, Lie algebras, and representations. Springer.
[27]
Shlomo Hoory, Nathan Linial, and Avi Wigderson. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc., 43, 4 (2006), 439–561.
[28]
Paata Ivanisvili and Yonathan Stone. 2022. The KKL inequality and Rademacher type 2. arXiv preprint arXiv:2204.05195.
[29]
J. Kahn, G. Kalai, and N. Linial. 1988. The influence of variables on Boolean functions. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science. 68–80.
[30]
Gil Kalai and Shmuel Safra. 2004. Threshold Phenomena and Influence with some perspectives from Mathematics. Computer Science and Economics.
[31]
Tali Kaufman and Dor Minzer. 2023. Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS).
[32]
Peter Keevash, Noam Lifshitz, Eoin Long, and Dor Minzer. 2021. Global hypercontractivity and its applications. arXiv preprint arXiv:2103.04604.
[33]
Peter Keevash, Noam Lifshitz, and Dor Minzer. 2022. On the largest product-free subsets of the alternating groups. arXiv preprint arXiv:2205.15191.
[34]
Subhash Khot, Dor Minzer, and Muli Safra. 2023. Pseudorandom sets in Grassmann graph have near-perfect expansion. Annals of Mathematics, 198, 1 (2023), 1–92.
[35]
Frederic Koehler and Elchanan Mossel. 2020. A Phase Transition in Arrow’s Theorem. arXiv preprint arXiv:2004.12580.
[36]
Steffen L Lauritzen. 1996. Graphical models. 17, Clarendon Press.
[37]
Katalin Marton. 2019. Logarithmic Sobolev inequalities in discrete product spaces. Combinatorics, Probability and Computing, 28, 6 (2019), 919–935.
[38]
Ashley Montanaro and Tobias J Osborne. 2008. Quantum boolean functions. arXiv preprint arXiv:0810.2435.
[39]
Ravi Montenegro and Prasad Tetali. 2006. Mathematical aspects of mixing times in Markov chains. Foundations and Trends® in Theoretical Computer Science, 1, 3 (2006), 237–354.
[40]
Elchanan Mossel. 2022. Probabilistic view of voting, paradoxes, and manipulation. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 59, 3 (2022), 297–330.
[41]
Elchanan Mossel and Allan Sly. 2009. Rapid mixing of Gibbs sampling on graphs that are sparse on average. Random Structures & Algorithms, 35, 2 (2009), 250–270.
[42]
Elchanan Mossel, Dror Weitz, and Nicholas Wormald. 2009. On the hardness of sampling independent sets beyond the tree threshold. Probability Theory and Related Fields, 143, 3-4 (2009), 401–439.
[43]
Ryan O’Donnell. 2014. Analysis of boolean functions. Cambridge University Press.
[44]
Ryan O’Donnell, Michael E. Saks, Oded Schramm, and Rocco A. Servedio. 2005. Every decision tree has an influential variable. In FOCS. 31–39.
[45]
Ryan O’Donnell and Karl Wimmer. 2013. KKL, Kruskal–Katona, and monotone nets. SIAM J. Comput., 42, 6 (2013), 2375–2399.
[46]
Ryan O’Donnell and Karl Wimmer. 2013. Sharpness of KKL on Schreier graphs.
[47]
Agoston Pisztora. 1996. Surface order large deviations for Ising, Potts and percolation models. Probability Theory and Related Fields, 104 (1996), 427–466.
[48]
Giacomo Raffaelli and Matteo Marsili. 2005. Statistical mechanics model for the emergence of consensus. Physical Review E, 72, 1 (2005), 016114.
[49]
Cambyse Rouzé, Melchior Wirth, and Haonan Zhang. 2022. Quantum Talagrand, KKL and Friedgut’s theorems and the learnability of quantum Boolean functions. arXiv preprint arXiv:2209.07279.
[50]
Alexander Russell, Michael Saks, and David Zuckerman. 1999. Lower bounds for leader election and collective coin-flipping in the perfect information model. In Proceedings of the thirty-first annual ACM symposium on Theory of Computing. 339–347.
[51]
Sushant Sachdeva and Madhur Tulsiani. 2011. Cuts in cartesian products of graphs. arXiv preprint arXiv:1105.3383.
[52]
Daniel W Stroock and Boguslaw Zegarlinski. 1992. The logarithmic Sobolev inequality for discrete spin systems on a lattice. Communications in Mathematical Physics, 149 (1992), 175–193.
[53]
Ramon Van Handel. 2014. Probability in high dimension. Lecture Notes (Princeton University).
Index Terms
- Influences in Mixing Measures
Recommendations
Mixing chiral polytopes
An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction lets us ...
Mixing polyhedra with two non divisible coefficients
We consider the mixed-integer set $${X=\{(s,x,y) \in \mathbb{R}\times \mathbb{Z}^n \times \mathbb{Z}^m: s + a_1 x_j \geq b_j, \forall j \in N_1, s + a_2 y_j \geq d_j, j \in N_2\}}$$ where $${N_1 = \{1,\ldots,n\},\; N_2 = \{1,\ldots,m\}}$$ and $${a_1, a_...
The Continuous Mixing Polyhedron
We analyze the polyhedral structure of the setsPCMIX = {( s, r, z) ?R XR+nXZ n|s +r j+z j=f j ,j = 1,..., n} andP+CMIX =PCMIXn{ s = 0}. The setP+CMIX is a natural generalization of the mixing set studied by Pochet and Wolsey [15, 16] and Günlük and ...
Comments
Information & Contributors
Information
Published In
June 2024
2049 pages
ISBN:9798400703836
DOI:10.1145/3618260
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
STOC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 15Total Downloads
- Downloads (Last 12 months)15
- Downloads (Last 6 weeks)15
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in