Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time

04/04/2022
by   Kun He, et al.
0

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. The expected running time of our algorithm is near-linear in n and a fixed polynomial in Δ, where n is the number of variables and Δ is the max degree of constraints. Previously, up to similar conditions, sampling algorithms with running time polynomial in both n and Δ, only existed for the almost atomic case, where each constraint is violated by a small number of forbidden local configurations. Our sampling approach departs from all previous fast algorithms for sampling LLL, which were based on Markov chains. A crucial step of our algorithm is a recursive marginal sampler that is of independent interests. Within a local lemma regime, this marginal sampler can draw a random value for a variable according to its marginal distribution, at a local cost independent of the size of the CSP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2020

Sampling Constraint Satisfaction Solutions in the Local Lemma Regime

We give a Markov chain based algorithm for sampling almost uniform solut...
research
07/08/2021

Perfect Sampling for (Atomic) Lovász Local Lemma

We give a Markov chain based perfect sampler for uniform sampling soluti...
research
03/05/2023

Exact Distributed Sampling

Fast distributed algorithms that output a feasible solution for constrai...
research
12/30/2022

Deterministic counting Lovász local lemma beyond linear programming

We give a simple combinatorial algorithm to deterministically approximat...
research
08/18/2023

Sampling from Network Reliability in Near-linear Time

We give a O(n) time sampler for independent sets of a matroid with n ele...
research
07/27/2023

Correlation decay up to the sampling threshold in the local lemma regime

We study the decay of correlation between locally constrained independen...
research
03/27/2013

A Polynomial Time Algorithm for Finding Bayesian Probabilities from Marginal Constraints

A method of calculating probability values from a system of marginal con...

Please sign up or login with your details

Forgot password? Click here to reset