Influence Maximization in Ising Models (2309.05206v2)
Abstract: Given a complex high-dimensional distribution over ${\pm 1}n$, what is the best way to increase the expected number of $+1$'s by controlling the values of only a small number of variables? Such a problem is known as influence maximization and has been widely studied in social networks, biology, and computer science. In this paper, we consider influence maximization on the Ising model which is a prototypical example of undirected graphical models and has wide applications in many real-world problems. We establish a sharp computational phase transition for influence maximization on sparse Ising models under a bounded budget: In the high-temperature regime, we give a linear-time algorithm for finding a small subset of variables and their values which achieve nearly optimal influence; In the low-temperature regime, we show that the influence maximization problem cannot be solved in polynomial time under commonly-believed complexity assumption. The critical temperature coincides with the tree uniqueness/non-uniqueness threshold for Ising models which is also a critical point for other computational problems including approximate sampling and counting.
- Spectral independence in high-dimensional expanders and applications to the hardcore model. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1319–1330, 2020.
- An ising model approach to malware epidemiology. arXiv preprint arXiv:1007.4938, 2010.
- Alexander Barvinok. Combinatorics and Complexity of Partition Functions, volume 30. Springer Algorithms and Combinatorics, 2016.
- Left and right convergence of graphs with bounded degree. Random Structures & Algorithms, 42(1):1–28, 2013.
- Learning restricted Boltzmann machines via influence maximization. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 828–839, 2019.
- Rapid mixing of Glauber dynamics up to uniqueness via contraction. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1307–1318, 2020.
- The power of an adversary in Glauber dynamics. arXiv preprint arXiv:2302.10841, 2023.
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. Combinatorics, Probability and Computing, 25(4):500–559, 2016.
- Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137–146, 2003.
- Influential nodes in a diffusion model for social networks. In Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings 32, pages 1127–1138. Springer, 2005.
- Adam Lipowski. Ising model: Recent developments and exotic applications. Entropy, 24(12):1834, 12 2022.
- Correlation decay up to uniqueness in spin systems. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 67–84, 2013.
- Analogy between the formulation of Ising-Glauber model and Si epidemiological model. Journal of Applied Mathematics and Physics, 7(05):1052, 2019.
- Influence maximization in social networks: An Ising-model-based approach. In Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 570–576. IEEE, 2010.
- The Ising model in physics and statistical genetics. The American Journal of Human Genetics, 69(4):853–862, 2001.
- Submodularity of influence in social networks: From local to global. SIAM Journal on Computing, 39(6):2176–2188, 2010.
- The spread of innovations in social networks. Proceedings of the National Academy of Sciences, 107(47):20196–20201, 2010.
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. SIAM Journal on Computing, 46(6):1893–1919, 2017.
- Allan Sly. Computational transition at the uniqueness threshold. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 287–296, 2010.
- The computational hardness of counting in two-spin models on d𝑑ditalic_d-regular graphs. The Annals of Probability, 42(6):2383–2416, 2014.
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. Journal of Statistical Physics, 155(4):666–686, 2014.
- Dror Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pages 140–149, 2006.