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 or . For this model, we establish the scaling window such that the probability of a random instance being satisfiable is greater than for and is less than for . Specifically, we obtain the following result where is a constant. A similar result with respect to the other parameter 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}
}