Spectral independence in high-dimensional expanders and applications to the hardcore model
From MaRDI portal
Publication:5009783
Recommendations
- Rapid mixing of hypergraph independent sets
- Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
- Slow mixing of Glauber dynamics for the hard-core model on the hypercube
- Fast convergence of the Glauber dynamics for sampling independent sets
- Sampling independent sets in the discrete torus
Cites work
- scientific article; zbMATH DE number 5485444 (Why is no real title available?)
- scientific article; zbMATH DE number 5764879 (Why is no real title available?)
- scientific article; zbMATH DE number 3909120 (Why is no real title available?)
- scientific article; zbMATH DE number 3909121 (Why is no real title available?)
- scientific article; zbMATH DE number 3951995 (Why is no real title available?)
- scientific article; zbMATH DE number 2019632 (Why is no real title available?)
- scientific article; zbMATH DE number 1559584 (Why is no real title available?)
- scientific article; zbMATH DE number 6469177 (Why is no real title available?)
- A note on the Glauber dynamics for sampling independent sets
- Applied analysis
- Approximate counting via correlation decay in spin systems
- Approximating partition functions of the two-state spin system
- Approximating the Permanent
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Combinatorics and complexity of partition functions
- Completely analytical interactions: Constructive description
- Computing the independence polynomial: from the tree threshold down to the roots
- Computing the permanent of (some) complex matrices
- Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
- Correlation decay and deterministic FPTAS for counting list-colorings of a graph
- 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
- Counting independent sets using the Bethe approximation
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Coupling with the stationary distribution and improved sampling for colorings and independent sets
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Fast convergence of the Glauber dynamics for sampling independent sets
- Fisher zeros and correlation decay in the Ising model
- Geometric bounds for eigenvalues of Markov chains
- High dimensional random walks and colorful expansion
- High order random walks: beyond spectral gap
- Improved analysis of higher order random walks and applications
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Local spectral expansion approach to high dimensional expanders. I: Descent of spectral gaps
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Matrix norms and rapid mixing for spin systems
- On Counting Independent Sets in Sparse Graphs
- On Markov Chains for Independent Sets
- On a conjecture of Sokal concerning roots of the independence polynomial
- On the hardness of sampling independent sets beyond the tree threshold
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- Phase coexistence and slow mixing for the hard-core model on \(\mathbb Z^{2}\)
- Phase coexistence for the hard-core model on \(\mathbb{Z}^2\)
- Prescribing a System of Random Variables by Conditional Distributions
- Spatial mixing and the connective constant: optimal bounds
- Swendsen-Wang dynamics for general graphs in the tree uniqueness region
- The Complexity of Enumeration and Reliability Problems
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
- The complexity of counting in sparse, regular, and planar graphs
- The computational complexity of two‐state spin systems
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
Cited in
(18)- Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
- Spectral independence, coupling, and the spectral gap of the Glauber dynamics
- Algorithms for hard-constraint point processes via discretization
- A spectral independence view on hard spheres via block dynamics
- Good quantum LDPC codes with linear time decoders
- Boolean function analysis on high-dimensional expanders
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- A new correlation inequality for Ising models with external fields
- Interactions of computational complexity theory and mathematics
- Log concavity and concentration of Lipschitz functions on the Boolean hypercube
- Invariance of the essential spectra for perturbations with unbounded hard cores
- Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
- Mixing of Markov chains for independent sets on chordal graphs with bounded separators
- Spectral telescope: convergence rate bounds for random-scan Gibbs samplers based on a hierarchical structure
- Polymer dynamics via cliques: new conditions for approximations
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Fast sampling via spectral independence beyond bounded-degree graphs
- Spectral independence via stability and applications to Holant-type problems
This page was built for publication: Spectral independence in high-dimensional expanders and applications to the hardcore model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009783)
