On the concentration of the number of solutions of random satisfiability formulas

Details On the concentration of the number of solutions of random satisfiability formulas On the concentration of the number of solutions of random satisfiability formulas

2010-06-18

arxiv.org/abs/1006.3786v1

Computer Science

Discrete Mathematics

Scientific paper

Let $Z(F)$ be the number of solutions of a random $k$-satisfiability formula $F$ with $n$ variables and clause density $\alpha$. Assume that the probability that $F$ is unsatisfiable is $O(1/\log(n)^{1+\e})$ for $\e>0$. We show that (possibly excluding a countable set of `exceptional' $\alpha$'s) the number of solutions concentrate in the logarithmic scale, i.e., there exists a non-random function $\phi(\alpha)$ such that, for any $\delta>0$, $(1/n)\log Z(F)\in [\phi-\delta,\phi+\delta]$ with high probability. In particular, the assumption holds for all $\alpha<1$, which proves the above concentration claim in the whole satisfiability regime of random $2$-SAT. We also extend these results to a broad class of constraint satisfaction problems. The proof is based on an interpolation technique from spin-glass theory, and on an application of Friedgut's theorem on sharp thresholds for graph properties.

Affiliated with

Also associated with

No associations

Rating

On the concentration of the number of solutions of random satisfiability formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the concentration of the number of solutions of random satisfiability formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the concentration of the number of solutions of random satisfiability formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-261363