The cavity method for large deviations

A method is introduced for studying large deviations in the context of statistical physics of disordered systems. The approach, based on an extension of the cavity method to atypical realizations of the quenched disorder, allows us to compute exponentially small probabilities (rate functions) over different classes of random graphs. It is illustrated with two combinatorial optimization problems, the vertex-cover and coloring problems, for which the presence of replica symmetry breaking phases is taken into account. Applications include the analysis of models on adaptive graph structures.Comment: 18 pages, 7 figure

Gravity as an emergent phenomenon: a GFT perspective

While the idea of gravity as an emergent phenomenon is an intriguing one, little is known about concrete implementations that could lead to viable phenomenology, most of the obstructions being related to the intrinsic difficulties of formulating genuinely pregeometric theories. In this paper we present a preliminary discussion of the impact of critical behavior of certain microscopic models for gravity, based on group field theories, on the dynamics of the macroscopic regime. The continuum limit is examined in light of some scaling assumption, and the relevant consequences for low energy effective theories are discussed, the role of universality, the corrections to scaling, the emergence of gravitational theories and the nature of their thermodynamical behavior.Comment: 1+26 page

Random subcubes as a toy model for constraint satisfaction problems

We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-coloring problems, and undergoes the same phase transitions as these problems. The comparison becomes quantitative in the large-k limit. Distance properties, as well the x-satisfiability threshold, are studied. The model is also generalized to define a continuous energy landscape useful for studying several aspects of glassy dynamics.Comment: 21 pages, 4 figure

Complex-network analysis of combinatorial spaces: The NK landscape case

We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of NK landscapes as an example. In our case the inherent network is the graph whose vertices represent the local maxima in the landscape, and the edges account for the transition probabilities between their corresponding basins of attraction. We exhaustively extracted such networks on representative NK landscape instances, and performed a statistical characterization of their properties. We found that most of these network properties are related to the search difficulty on the underlying NK landscapes with varying values of K.Comment: arXiv admin note: substantial text overlap with arXiv:0810.3492, arXiv:0810.348

`The frozen accident' as an evolutionary adaptation: A rate distortion theory perspective on the dynamics and symmetries of genetic coding mechanisms

We survey some interpretations and related issues concerning the frozen hypothesis due to F. Crick and how it can be explained in terms of several natural mechanisms involving error correction codes, spin glasses, symmetry breaking and the characteristic robustness of genetic networks. The approach to most of these questions involves using elements of Shannon's rate distortion theory incorporating a semantic system which is meaningful for the relevant alphabets and vocabulary implemented in transmission of the genetic code. We apply the fundamental homology between information source uncertainty with the free energy density of a thermodynamical system with respect to transcriptional regulators and the communication channels of sequence/structure in proteins. This leads to the suggestion that the frozen accident may have been a type of evolutionary adaptation

Zero temperature solutions of the Edwards-Anderson model in random Husimi Lattices

We solve the Edwards-Anderson model (EA) in different Husimi lattices. We show that, at T=0, the structure of the solution space depends on the parity of the loop sizes. Husimi lattices with odd loop sizes have always a trivial paramagnetic solution stable under 1RSB perturbations while, in Husimi lattices with even loop sizes, this solution is absent. The range of stability under 1RSB perturbations of this and other RS solutions is computed analytically (when possible) or numerically. We compute the free-energy, the complexity and the ground state energy of different Husimi lattices at the level of the 1RSB approximation. We also show, when the fraction of ferromagnetic couplings increases, the existence, first, of a discontinuous transition from a paramagnetic to a spin glass phase and latter of a continuous transition from a spin glass to a ferromagnetic phase.Comment: 20 pages, 10 figures (v3: Corrected analysis of transitions. Appendix proof fixed

Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine

Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum algorithm is known for these problems, and intensive research is focused on creating physical systems - Ising machines - capable of finding the absolute or approximate ground states of the Ising Hamiltonian [2-6]. Here we report a novel Ising machine using a network of degenerate optical parametric oscillators (OPOs). Spins are represented with above-threshold binary phases of the OPOs and the Ising couplings are realized by mutual injections [7]. The network is implemented in a single OPO ring cavity with multiple trains of femtosecond pulses and configurable mutual couplings, and operates at room temperature. We programed the smallest non-deterministic polynomial time (NP)- hard Ising problem on the machine, and in 1000 runs of the machine no computational error was detected

Glass models on Bethe lattices

We consider ``lattice glass models'' in which each site can be occupied by at most one particle, and any particle may have at most l occupied nearest neighbors. Using the cavity method for locally tree-like lattices, we derive the phase diagram, with a particular focus on the vitreous phase and the highest packing limit. We also study the energy landscape via the configurational entropy, and discuss different equilibrium glassy phases. Finally, we show that a kinetic freezing, depending on the particular dynamical rules chosen for the model, can prevent the equilibrium glass transitions.Comment: 24 pages, 11 figures; minor corrections + enlarged introduction and conclusio