1,720 research outputs found

    How to compute the thermodynamics of a glass using a cloned liquid

    Full text link
    The recently proposed strategy for studying the equilibrium thermodynamics of the glass phase using a molecular liquid is reviewed and tested in details on the solvable case of the pp-spin model. We derive the general phase diagram, and confirm the validity of this procedure. We point out the efficacy of a system of two weakly coupled copies in order to identify the glass transition, and the necessity to study a system with m<1m<1 copies ('clones') of the original problem in order to derive the thermodynamic properties of the glass phase.Comment: Latex, 17 pages, 6 figure

    Thermodynamics of the L\'evy spin glass

    Full text link
    We investigate the L\'evy glass, a mean-field spin glass model with power-law distributed couplings characterized by a divergent second moment. By combining extensively many small couplings with a spare random backbone of strong bonds the model is intermediate between the Sherrington-Kirkpatrick and the Viana-Bray model. A truncated version where couplings smaller than some threshold \eps are neglected can be studied within the cavity method developed for spin glasses on locally tree-like random graphs. By performing the limit \eps\to 0 in a well-defined way we calculate the thermodynamic functions within replica symmetry and determine the de Almeida-Thouless line in the presence of an external magnetic field. Contrary to previous findings we show that there is no replica-symmetric spin glass phase. Moreover we determine the leading corrections to the ground-state energy within one-step replica symmetry breaking. The effects due to the breaking of replica symmetry appear to be small in accordance with the intuitive picture that a few strong bonds per spin reduce the degree of frustration in the system

    Pairs of SAT Assignment in Random Boolean Formulae

    Get PDF
    We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments differing in Nx variables. We show the existence of a sharp threshold for this property as a function of the clause density. For large enough K, we prove that there exists a region of clause density, below the satisfiability threshold, where the landscape of Hamming distances between SAT assignments experiences a gap: pairs of SAT-assignments exist at small x, and around x=1/2, but they donot exist at intermediate values of x. This result is consistent with the clustering scenario which is at the heart of the recent heuristic analysis of satisfiability using statistical physics analysis (the cavity method), and its algorithmic counterpart (the survey propagation algorithm). The method uses elementary probabilistic arguments (first and second moment methods), and might be useful in other problems of computational and physical interest where similar phenomena appear

    Spectra of Euclidean Random Matrices

    Full text link
    We study the spectrum of a random matrix, whose elements depend on the Euclidean distance between points randomly distributed in space. This problem is widely studied in the context of the Instantaneous Normal Modes of fluids and is particularly relevant at the glass transition. We introduce a systematic study of this problem through its representation by a field theory. In this way we can easily construct a high density expansion, which can be resummed producing an approximation to the spectrum similar to the Coherent Potential Approximation for disordered systems.Comment: 10 pages, 4 figure

    The Physics of the Glass Transition

    Full text link
    In this talk, after a short phenomenological introduction on glasses, I will describe some recent progresses that have been done in glasses using the replica method in the definition and in the evaluation of the configurational entropy (or complexity). These results are at the basis of some analytic computations of the thermodynamic glass transition and of the properties below the phase transition point.Comment: 12 pages, 5 figures, invited talk at the II Paladin Memorial Conferenc

    Threshold values of Random K-SAT from the cavity method

    Full text link
    Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random KK-satisfiability problem, generalizing the previous results to K≥4K \ge 4. We also give an analytic solution of the equations, and some closed expressions for these thresholds, in an expansion around large KK. The stability of the solution is also computed. For any KK, the satisfiability threshold is found to be in the stable region of the solution, which adds further credit to the conjecture that this computation gives the exact satisfiability threshold.Comment: 38 pages; extended explanations and derivations; this version is going to appear in Random Structures & Algorithm

    Phase space diffusion and low temperature aging

    Full text link
    We study the dynamical evolution of a system with a phase space consisting of configurations with random energies. The dynamics we use is of Glauber type. It allows for some dynamical evolution ang aging even at very low temperatures, through the search of configurations with lower energies.Comment: 11 pages latex, 1 ps figure adde

    Survey propagation: an algorithm for satisfiability

    Full text link
    We study the satisfiability of randomly generated formulas formed by MM clauses of exactly KK literals over NN Boolean variables. For a given value of NN the problem is known to be most difficult with α=M/N\alpha=M/N close to the experimental threshold αc\alpha_c separating the region where almost all formulas are SAT from the region where all formulas are UNSAT. Recent results from a statistical physics analysis suggest that the difficulty is related to the existence of a clustering phenomenon of the solutions when α\alpha is close to (but smaller than) αc\alpha_c. We introduce a new type of message passing algorithm which allows to find efficiently a satisfiable assignment of the variables in the difficult region. This algorithm is iterative and composed of two main parts. The first is a message-passing procedure which generalizes the usual methods like Sum-Product or Belief Propagation: it passes messages that are surveys over clusters of the ordinary messages. The second part uses the detailed probabilistic information obtained from the surveys in order to fix variables and simplify the problem. Eventually, the simplified problem that remains is solved by a conventional heuristic.Comment: 19 pages, 6 figur

    Distribution of diameters for Erd\"os-R\'enyi random graphs

    Get PDF
    We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic processes taking place on graphs. Here we study the distribution P(d) numerically for various values of c, in the non-percolating and the percolating regime. Using large-deviations techniques, we are able to reach small probabilities like 10^{-100} which allow us to obtain the distribution over basically the full range of the support, for graphs up to N=1000 nodes. For values c<1, our results are in good agreement with analytical results, proving the reliability of our numerical approach. For c>1 the distribution is more complex and no complete analytical results are available. For this parameter range, P(d) exhibits an inflection point, which we found to be related to a structural change of the graphs. For all values of c, we determined the finite-size rate function Phi(d/N) and were able to extrapolate numerically to N->infinity, indicating that the large deviation principle holds.Comment: 9 figure

    The Wandering Exponent of a One-Dimensional Directed Polymer in a Random Potential with Finite Correlation Radius

    Full text link
    We consider a one-dimensional directed polymer in a random potential which is characterized by the Gaussian statistics with the finite size local correlations. It is shown that the well-known Kardar's solution obtained originally for a directed polymer with delta-correlated random potential can be applied for the description of the present system only in the high-temperature limit. For the low temperature limit we have obtained the new solution which is described by the one-step replica symmetry breaking. For the mean square deviation of the directed polymer of the linear size L it provides the usual scaling L2zL^{2z} with the wandering exponent z = 2/3 and the temperature-independent prefactor.Comment: 14 pages, Late
    • …
    corecore