Quick search Find article
Quick search
Find article

Clustering of solutions in hard satisfiability problems

John Ardelius1, Erik Aurell2 and Supriya Krishnamurthy3

Show affiliations


Figure 1

Figure 1. The mean value and the variance of the overlaps between a set of 40 solutions found by ASAT. Ranging from α = 3.7 to 4.3. N = 2000 variables.



Figure 2

Figure 2. Rank plot of the values of the overlap matrix D for α = 3.5, 3.6, 3.7, 3.8, 3.9, 4.0, 4.1, 4.2, 4.25 and 4.3, N = 2000. Self-overlaps are left out. For low values of α, the curves are continuously distributed around one mean value. When the number of constraints increases the distribution tends to spread out. Increasing α even further results in a break-up of the distribution. The solutions found are then grouped together in clusters. The overlap of solutions in the same cluster is high ( > 0.9N), while the overlap between solutions in different clusters is lower ({\simeq }0.6N ).



Figure 3

Figure 3. The result of the clustering algorithm shows how many disks with given radius are required to cover the whole set of solutions. The three curves shows this for α = 4.2, 4.25 and 4.3, N = 2000. The small subplot is an enlargement of the curve for α = 4.3.



Figure 4

Figure 4. The first plot shows overlap between a solution found by SP and one found by ASAT for α = 0 to 4.3. The other plot show the overlaps between two different solutions found by ASAT on the same instance. The number of variables are 2000 and 10 000 in both cases.



Figure 5

Figure 5. (a) For each chain the point in α where the smallest overlap in the overlap matrix is above 0.8N is marked for N = 100, 200, 400, 1000 and 2000 variables. 110 chains are used for each N. The point of the jump of each chain marks one point in the rank plot. The mean value of the N = 2000 curve is 4.245. (b) Finite size scaling applied to the same data. The best fit is achieved for ν = 1.7 and \alpha_{\infty }=4.26 . The ruggedness of the curves for large N is due to discretization in α.



Figure 6

Figure 6. The fraction of instances that display a condensation transition within the time cut-off.




  1. Clustering of solutions in hard satisfiability problems

    John Ardelius et al J. Stat. Mech. (2007) P10012

  2. Imaging the stick–slip peeling of an adhesive tape under a constant load

    Pierre-Philippe Cortet et al J. Stat. Mech. (2007) P03005

  3. Universal distribution of random matrix eigenvalues near the 'birth of a cut' transition

    B Eynard J. Stat. Mech. (2006) P07005

  4. Self-consistent density functional calculation of the image potential at a metal surface

    J Jung et al 2007 J. Phys.: Condens. Matter 19 266008

  5. Multi-dimensional fission barriers for heavy and superheavy nuclei

    A Sobiczewski and M Kowal 2006 Phys. Scr. 2006 68

  6. Fluctuation theorems for stochastic dynamics

    R J Harris and G M Schütz J. Stat. Mech. (2007) P07020

  7. Hamilton relativity group for noninertial states in quantum mechanics

    Stephen G Low 2008 J. Phys. A: Math. Theor. 41 304034

  8. Pulse trains in molecular dynamics and coherent spectroscopy: a theoretical study

    J Voll and R de Vivie-Riedle 2009 New J. Phys. 11 105036

  9. New phenomena at the interfaces of very thin ferroelectric oxides

    M Dawber et al 2008 J. Phys.: Condens. Matter 20 264015

  10. Electrochemical properties of sulfur electrode containing nano Al2O3 for lithium/sulfur cell

    Y J Choi et al 2007 Phys. Scr. 2007 62

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.