Searcharxiv⌕ Search

arXiv subjects

Remi Monasson

Publications and source records attributed to Remi Monasson.

43 records · Page 3Linked to original sources
arXiv1998

Tricritical Points in Random Combinatorics: the (2+p)-SAT case

The (2+p)-Satisfiability (SAT) problem interpolates between different classes of complexity theory and is believed to be of basic interest in understanding the onset of typical case complexity in random combinatorics. In this paper, a tricritical point in the phase diagram of the random $2+p$-SAT problem is analytically computed using the replica approach and found to lie in the range $2/5 \le p_0 \le 0.416$. These bounds on $p_0$ are in agreement with previous numerical simulations and rigorous results.

cond-mat.dis-nn↗
arXiv1997

Optimisation problems and replica symmetry breaking in finite connectivity spin-glasses

A formalism capable of handling the first step of hierarchical replica symmetry breaking in finite-connectivity models is introduced. The emerging order parameter is claimed to be a probability distribution over the space of field distributions (or, equivalently magnetisation distributions) inside the cluster of states. The approach is shown to coincide with the previous works in the replica symmetric case and in the two limit cases m=0,1 where m is Parisi's break-point. As an application to the study of optimization problems, the ground-state properties of the random 3-Satisfiability problem are investigated and we present a first RSB solution improving replica symmetric results.

cond-mat.dis-nn↗
arXiv1996

The Entropy of the K-Satisfiability Problem

The threshold behaviour of the K-Satisfiability problem is studied in the framework of the statistical mechanics of random diluted systems. We find that at the transition the entropy is finite and hence that the transition itself is due to the abrupt appearance of logical contradictions in all solutions and not to the progressive decreasing of the number of these solutions down to zero. A physical interpretation is given for the different cases $K=1$, $K=2$ and $K \geq 3$.

cond-mat↗
arXiv1996

Learning and generalization theories of large committee--machines

The study of the distribution of volumes associated to the internal representations of learning examples allows us to derive the critical learning capacity ($α_c=\frac{16}π \sqrt{\ln K}$) of large committee machines, to verify the stability of the solution in the limit of a large number $K$ of hidden units and to find a Bayesian generalization cross--over at $α=K$.

cond-mat↗
arXiv1995

A mean-field hard-spheres model of glass

We present a model of spheres moving in a high-dimensional compact space. We relate it to a mixed matrix model with a $O(N)$ invariant model plus a $P(N)$ invariant perturbation. We then study the low pressure regime by performing a diagrammatic expansion of this matrix model. Finally, we show the results from numerical simulations and we present evidence for a glassy regime at high pressures.

cond-mat↗
arXiv1995

How (Super) Rough is the Glassy Phase of a Crystalline Surface with a Disordered Substrate?

We discuss the behavior of a crystalline surface with a disordered substrate. We focus on the possible existence of a {\em super-rough} glassy phase, with height-height correlation functions which vary as the square logarithm of the distance. With numerical simulations we establish the presence of such a behavior, that does not seem to be connected to finite size effects. We comment on the variational approach, and suggest that a more general extension of the method could be needed to explain fully the behavior of the model.

cond-mat↗