English

On the Scaling Window of Model RB

Computational Complexity 2008-01-28 v1 Statistical Mechanics Artificial Intelligence

Abstract

This paper analyzes the scaling window of a random CSP model (i.e. model RB) for which we can identify the threshold points exactly, denoted by rcrr_{cr} or pcrp_{cr}. For this model, we establish the scaling window W(n,δ)=(r(n,δ),r+(n,δ))W(n,\delta)=(r_{-}(n,\delta), r_{+}(n,\delta)) such that the probability of a random instance being satisfiable is greater than 1δ1-\delta for r<r(n,δ)r<r_{-}(n,\delta) and is less than δ\delta for r>r+(n,δ)r>r_{+}(n,\delta). Specifically, we obtain the following result W(n,δ)=(rcrΘ(1n1ϵlnn), rcr+Θ(1nlnn)),W(n,\delta)=(r_{cr}-\Theta(\frac{1}{n^{1-\epsilon}\ln n}), \ r_{cr}+\Theta(\frac{1}{n\ln n})), where 0ϵ<10\leq\epsilon<1 is a constant. A similar result with respect to the other parameter pp is also obtained. Since the instances generated by model RB have been shown to be hard at the threshold, this is the first attempt, as far as we know, to analyze the scaling window of such a model with hard instances.

Cite

@article{arxiv.0801.3871,
  title  = {On the Scaling Window of Model RB},
  author = {Chunyan Zhao and Ke Xu and Zhiming Zheng},
  journal= {arXiv preprint arXiv:0801.3871},
  year   = {2008}
}
R2 v1 2026-06-21T10:06:21.568Z