On the critical exponents of random k-SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2-SAT this happens when m/n --> 1, for 3-SAT the critical ratio is thought to be m/n ~ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called \nu=\nu_k (the smaller the value of \nu the sharper the transition). Experiments have suggested that \nu_3 = 1.5+-0.1, \nu_4 = 1.25+-0.05, \nu_5=1.1+-0.05, \nu_6 = 1.05+-0.05, and heuristics have suggested that \nu_k --> 1 as k --> infinity. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well-defined). This result holds for each of the three standard ensembles of random k-SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q-colorability and the appearance of a q-core in a random graph.Comment: 11 pages. v2 has revised introduction and updated reference

Phase coexistence and finite-size scaling in random combinatorial problems

We study an exactly solvable version of the famous random Boolean satisfiability problem, the so called random XOR-SAT problem. Rare events are shown to affect the combinatorial ``phase diagram'' leading to a coexistence of solvable and unsolvable instances of the combinatorial problem in a certain region of the parameters characterizing the model. Such instances differ by a non-extensive quantity in the ground state energy of the associated diluted spin-glass model. We also show that the critical exponent $\nu$, controlling the size of the critical window where the probability of having solutions vanishes, depends on the model parameters, shedding light on the link between random hyper-graph topology and universality classes. In the case of random satisfiability, a similar behavior was conjectured to be connected to the onset of computational intractability.Comment: 10 pages, 5 figures, to appear in J. Phys. A. v2: link to the XOR-SAT probelm adde

Dynamic scaling and universality in evolution of fluctuating random networks

We found that models of evolving random networks exhibit dynamic scaling similar to scaling of growing surfaces. It is demonstrated by numerical simulations of two variants of the model in which nodes are added as well as removed [Phys. Rev. Lett. 83, 5587 (1999)]. The averaged size and connectivity of the network increase as power-laws in early times but later saturate. Saturated values and times of saturation change with paramaters controlling the local evolution of the network topology. Both saturated values and times of saturation obey also power-law dependences on controlling parameters. Scaling exponents are calculated and universal features are discussed.Comment: 7 pages, 6 figures, Europhysics Letters for

Magnetoresistance of Three-Constituent Composites: Percolation Near a Critical Line

Scaling theory, duality symmetry, and numerical simulations of a random network model are used to study the magnetoresistance of a metal/insulator/perfect conductor composite with a disordered columnar microstructure. The phase diagram is found to have a critical line which separates regions of saturating and non-saturating magnetoresistance. The percolation problem which describes this line is a generalization of anisotropic percolation. We locate the percolation threshold and determine the t = s = 1.30 +- 0.02, nu = 4/3 +- 0.02, which are the same as in two-constituent 2D isotropic percolation. We also determine the exponents which characterize the critical dependence on magnetic field, and confirm numerically that nu is independent of anisotropy. We propose and test a complete scaling description of the magnetoresistance in the vicinity of the critical line.Comment: Substantially revised version; description of behavior in finite magnetic fields added. 7 pages, 7 figures, submitted to PR

On the freezing of variables in random constraint satisfaction problems

The set of solutions of random constraint satisfaction problems (zero energy groundstates of mean-field diluted spin glasses) undergoes several structural phase transitions as the amount of constraints is increased. This set first breaks down into a large number of well separated clusters. At the freezing transition, which is in general distinct from the clustering one, some variables (spins) take the same value in all solutions of a given cluster. In this paper we study the critical behavior around the freezing transition, which appears in the unfrozen phase as the divergence of the sizes of the rearrangements induced in response to the modification of a variable. The formalism is developed on generic constraint satisfaction problems and applied in particular to the random satisfiability of boolean formulas and to the coloring of random graphs. The computation is first performed in random tree ensembles, for which we underline a connection with percolation models and with the reconstruction problem of information theory. The validity of these results for the original random ensembles is then discussed in the framework of the cavity method.Comment: 32 pages, 7 figure

The Scaling Window of the 2-SAT Transition

We consider the random 2-satisfiability problem, in which each instance is a formula that is the conjunction of m clauses of the form (x or y), chosen uniformly at random from among all 2-clauses on n Boolean variables and their negations. As m and n tend to infinity in the ratio m/n --> alpha, the problem is known to have a phase transition at alpha_c = 1, below which the probability that the formula is satisfiable tends to one and above which it tends to zero. We determine the finite-size scaling about this transition, namely the scaling of the maximal window W(n,delta) = (alpha_-(n,delta),alpha_+(n,delta)) such that the probability of satisfiability is greater than 1-delta for alpha < alpha_- and is less than delta for alpha > alpha_+. We show that W(n,delta)=(1-Theta(n^{-1/3}),1+Theta(n^{-1/3})), where the constants implicit in Theta depend on delta. We also determine the rates at which the probability of satisfiability approaches one and zero at the boundaries of the window. Namely, for m=(1+epsilon)n, where epsilon may depend on n as long as |epsilon| is sufficiently small and |epsilon|*n^(1/3) is sufficiently large, we show that the probability of satisfiability decays like exp(-Theta(n*epsilon^3)) above the window, and goes to one like 1-Theta(1/(n*|epsilon|^3)) below the window. We prove these results by defining an order parameter for the transition and establishing its scaling behavior in n both inside and outside the window. Using this order parameter, we prove that the 2-SAT phase transition is continuous with an order parameter critical exponent of 1. We also determine the values of two other critical exponents, showing that the exponents of 2-SAT are identical to those of the random graph.Comment: 57 pages. This version updates some reference

Barkhausen Noise and Critical Scaling in the Demagnetization Curve

The demagnetization curve, or initial magnetization curve, is studied by examining the embedded Barkhausen noise using the non-equilibrium, zero temperature random-field Ising model. The demagnetization curve is found to reflect the critical point seen as the system's disorder is changed. Critical scaling is found for avalanche sizes and the size and number of spanning avalanches. The critical exponents are derived from those related to the saturation loop and subloops. Finally, the behavior in the presence of long range demagnetizing fields is discussed. Results are presented for simulations of up to one million spins.Comment: 4 pages, 4 figures, submitted to Physical Review Letter

Scaling properties of a ferromagnetic thin film model at the depinning transition

In this paper, we perform a detailed study of the scaling properties of a ferromagnetic thin film model. Recently, interest has increased in the scaling properties of the magnetic domain wall (MDW) motion in disordered media when an external driving field is present. We consider a (1+1)-dimensional model, based on evolution rules, able to describe the MDW avalanches. The global interface width of this model shows Family-Vicsek scaling with roughness exponent $\zeta\simeq 1.585$ and growth exponent $\beta\simeq 0.975$. In contrast, this model shows scaling anomalies in the interface local properties characteristic of other systems with depinning transition of the MDW, e.g. quenched Edwards-Wilkinson (QEW) equation and random-field Ising model (RFIM) with driving. We show that, at the depinning transition, the saturated average velocity $v_\mathrm{sat}\sim f^\theta$ vanished very slowly (with $\theta\simeq 0.037$) when the reduced force $f=p/p_\mathrm{c}-1\to 0^{+}$. The simulation results show that this model verifies all accepted scaling relations which relate the global exponents and the correlation length (or time) exponents, valid in systems with depinning transition. Using the interface tilting method, we show that the model, close to the depinning transition, exhibits a nonlinearity similar to the one included in the Kardar-Parisi-Zhang (KPZ) equation. The nonlinear coefficient $\lambda\sim f^{-\phi}$ with $\phi\simeq -1.118$, which implies that $\lambda\to 0$ as the depinning transition is approached, a similar qualitatively behaviour to the driven RFIM. We conclude this work by discussing the main features of the model and the prospects opened by it.Comment: 10 pages, 5 figures, 1 tabl