Fundamentals of partial rejection sampling
From MaRDI portal
Publication:6601395
DOI10.1214/24-ps29zbMATH Open1545.60017MaRDI QIDQ6601395
Publication date: 10 September 2024
Published in: Probability Surveys (Search for Journal in Brave)
Combinatorial probability (60C05) Randomized algorithms (68W20) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Counting in two-spin models on \(d\)-regular graphs
- On a problem of Spencer
- Graph homomorphisms and phase transitions
- Perfect sampling using bounding chains.
- Strong convergence and a game of numbers
- Perfect simulation of the hard disks model by partial rejection sampling
- Perfect sampling for Gibbs point processes using partial rejection sampling
- Random curves on surfaces induced from the Laplacian determinant
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Combinatorial problems of commutation and rearrangements
- An Improvement of the Lovász Local Lemma via Cluster Expansion
- An Extension of the Moser--Tardos Algorithmic Local Lemma
- A constructive proof of the general lovász local lemma
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Commutativity in the Algorithmic Lovász Local Lemma
- Fast convergence of the Glauber dynamics for sampling independent sets
- On the computational complexity of the Jones and Tutte polynomials
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles
- Lopsidependency in the Moser-Tardos Framework
- Approximately counting bases of bicircular matroids
- Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
- Tight bounds for popping algorithms
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
- Uniform Sampling Through the Lovász Local Lemma
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- Generalized loop‐erased random walks and approximate reachability
- Moser and tardos meet Lovász
- Dynamic Sampling from Graphical Models
- Generating a random sink-free orientation in quadratic time
- Perfect sampling from spatial mixing
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
This page was built for publication: Fundamentals of partial rejection sampling