Influence maximization in Ising models
From MaRDI portal
Cites work
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Automata, Languages and Programming
- Combinatorics and complexity of partition functions
- Computational transition at the uniqueness threshold
- Correlation decay up to uniqueness in spin systems
- Counting in two-spin models on \(d\)-regular graphs
- Counting independent sets up to the tree threshold
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Learning restricted Boltzmann machines via influence maximization
- Left and right convergence of graphs with bounded degree
- Rapid mixing of Glauber dynamics up to uniqueness via contraction
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Submodularity of influence in social networks: from local to global
This page was built for publication: Influence maximization in Ising models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906406)