Fast and perfect sampling of subgraphs and polymer systems
From MaRDI portal
Cites work
- A generalization of the Catalan numbers
- A unified approach to phase diagrams in field theory and statistical mechanics
- Algorithmic Pirogov-Sinai theory
- Algorithms for \#BIS-hard problems on expander graphs
- Approximately counting independent sets in bipartite graphs via graph containers
- Cluster expansion for abstract polymer models
- Computational transition at the uniqueness threshold
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
- Counting independent sets in unbalanced bipartite graphs
- Counting independent sets up to the tree threshold
- Efficient and near-optimal algorithms for sampling connected subgraphs
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Fast algorithms at low temperatures via Markov chains†
- Fast algorithms for general spin systems on bipartite expanders
- Fast mixing via polymers for random graphs with unbounded degree
- Fast simulation of new coins from old
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- First-hitting times under drift
- scientific article; zbMATH DE number 1559556 (Why is no real title available?)
- scientific article; zbMATH DE number 7561741 (Why is no real title available?)
- Improved Bounds for Sampling Solutions of Random CNF Formulas
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Left and right convergence of graphs with bounded degree
- Mixing time bounds for graphlet random walks
- On Exact Simulation of Markov Random Fields Using Coupling from the Past
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- Perfect sampling for hard spheres from strong spatial mixing
- Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
- Perfect sampling using bounding chains.
- Rapid mixing of Glauber dynamics up to uniqueness via contraction
- Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region
- Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time
- The computational hardness of counting in two-spin models on d-regular graphs
- The hardness of sampling connected subgraphs
- The relative complexity of approximate counting problems
This page was built for publication: Fast and perfect sampling of subgraphs and polymer systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023574)
