Parallelize single-site dynamics up to Dobrushin criterion
From MaRDI portal
Cites work
- A constructive proof of the general Lovász local lemma
- A general lower bound for mixing of single-site dynamics on graphs
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Approximate counting, the Lovász local lemma, and inference in graphical models
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- Communication for Generating Correlation: A Unifying Survey
- Communication-efficient distributed statistical inference
- Counting in two-spin models on \(d\)-regular graphs
- Dynamic Sampling from Graphical Models
- Entropic independence: optimal mixing of down-up random walks
- Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime
- scientific article; zbMATH DE number 5485476 (Why is no real title available?)
- scientific article; zbMATH DE number 5485509 (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 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- scientific article; zbMATH DE number 786469 (Why is no real title available?)
- scientific article; zbMATH DE number 7561278 (Why is no real title available?)
- scientific article; zbMATH DE number 7650375 (Why is no real title available?)
- scientific article; zbMATH DE number 7788465 (Why is no real title available?)
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Independent sets versus perfect matchings
- Information, Physics, and Computation
- Localization schemes: a framework for proving mixing bounds for Markov chains (extended abstract)
- Logarithmic Sobolev inequalities in discrete product spaces
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Matrix norms and rapid mixing for spin systems
- On Local Distributed Sampling and Counting
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization
- Optimal mixing for two-state anti-ferromagnetic spin systems
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- Optimality of correlated sampling strategies
- Parallel discrete sampling via continuous walks
- Polynomial-Time Approximation Algorithms for the Ising Model
- Prescribing a System of Random Variables by Conditional Distributions
- Rapid mixing of Glauber dynamics up to uniqueness via contraction
- Rapid mixing of Glauber dynamics via spectral independence for all degrees
- Sampling constraint satisfaction solutions in the local lemma regime
- SIMD parallel MCMC sampling with applications for big-data Bayesian analytics
- Similarity estimation techniques from rounding algorithms
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Stability is stable: connections between replicability, privacy, and adaptive generalization
- Time-Dependent Statistics of the Ising Model
- Uniform sampling through the Lovász local lemma
- What Can be Sampled Locally?
This page was built for publication: Parallelize single-site dynamics up to Dobrushin criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939381)
