activity
19952025
most citedThe structural glass transition and the entropy of the metastable states

467 citations · 4.2k across the 83 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

22 papers · 1 filter

cond-mat.stat-mech2023★ 4 cited

Evolutionary Dynamics of a Lattice Dimer: a Toy Model for Stability vs. Affinity Trade-offs in Proteins

Emanuele Loffredo, Elisabetta Vesconi, Rostam Razban +4

Understanding how a stressor applied on a biological system shapes its evolution is key to achieving targeted evolutionary control. Here we present a toy model of two interacting l…

cond-mat.stat-mech2019★ 28 cited

Inference of compressed Potts graphical models

Francesca Rizzato, Alice Coucke, Eleonora de Leonardis +4

We consider the problem of inferring a graphical Potts model on a population of variables, with a non-uniform number of Potts colors (symbols) across variables. This inverse Potts…

cond-mat.stat-mech2016

Inference of principal components of noisy correlation matrices with prior information

Rémi Monasson

The problem of infering the top component of a noisy sample covariance matrix with prior information about the distribution of its entries is considered, in the framework of the sp…

cond-mat.stat-mech2015★ 38 cited

Transitions between spatial attractors in place-cell networks

R Monasson, S Rosay

The spontaneous transitions between D-dimensional spatial maps in an attractor neural network are studied. Two scenarios for the transition from on map to another are found, depend…

cond-mat.stat-mech2015★ 9 cited

Learning probabilities from random observables in high dimensions: the maximum entropy distribution and others

Tomoyuki Obuchi, Simona Cocco, Rémi Monasson

We consider the problem of learning a target probability distribution over a set of binary variables from the knowledge of the expectation values (with this target distribution…

cond-mat.stat-mech2015★ 17 cited

Estimating the principal components of correlation matrices from all their empirical eigenvectors

Rémi Monasson, Dario Villamaina

We consider the problem of estimating the principal components of a population correlation matrix from a limited number of measurement data. Using a combination of random matrix an…

cond-mat.stat-mech2011★ 40 cited

High-Dimensional Inference with the generalized Hopfield Model: Principal Component Analysis and Corrections

Simona Cocco, Remi Monasson, Vitor Sessak

We consider the problem of inferring the interactions between a set of N binary variables from the knowledge of their frequencies and pairwise correlations. The inference framework…

cond-mat.stat-mech2007★ 5 cited

Introduction to Phase Transitions in Random Optimization Problems

Remi Monasson

Notes of the lectures delivered in Les Houches during the Summer School on Complex Systems (July 2006).

cond-mat.stat-mech2005★ 11 cited

Criticality and Universality in the Unit-Propagation Search Rule

Christophe Deroulers, Rémi Monasson

The probability Psuccess(alpha, N) that stochastic greedy algorithms successfully solve the random SATisfiability problem is studied as a function of the ratio alpha of constraints…

cond-mat.stat-mech2005★ 29 cited

An algorithm for counting circuits: application to real-world and random graphs

Enzo Marinari, Remi Monasson, Guilhem Semerjian

We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circ…

cond-mat.stat-mech2004★ 5 cited

Critical behaviour of combinatorial search algorithms, and the unitary-propagation universality class

Christophe Deroulers, Rémi Monasson

The probability P(alpha, N) that search algorithms for random Satisfiability problems successfully find a solution is studied as a function of the ratio alpha of constraints per va…

cond-mat.stat-mech2003★ 61 cited

On large deviation properties of Erdos-Renyi random graphs

Andreas Engel, Rémi Monasson, Alexander K. Hartmann

We show that large deviation properties of Erdös-Rényi random graphs can be derived from the free energy of the -state Potts model of statistical mechanics. More precisely the L…

cond-mat.stat-mech2003★ 40 cited

Field theoretic approach to metastability in the contact process

Christophe Deroulers, Rémi Monasson

A quantum field theoretic formulation of the dynamics of the Contact Process on a regular graph of degree z is introduced. A perturbative calculation in powers of 1/z of the effect…

cond-mat.stat-mech2002★ 158 cited

Rigorous decimation-based construction of ground pure states for spin glass models on random lattices

S. Cocco, O. Dubois, J. Mandler +1

A constructive scheme for determining pure states (clusters) at very low temperature in the 3-spins glass model on a random lattice is provided, in full agreement with Parisi's one…

cond-mat.stat-mech2002★ 1 cited

Restart method and exponential acceleration of random 3-SAT instances resolutions: a large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm

S. Cocco, R. Monasson

The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a so…

cond-mat.stat-mech2002★ 177 cited

Force and kinetic barriers in unzipping of DNA

S. Cocco, R. Monasson, J. Marko

A theory of the unzipping of double-stranded (ds) DNA is presented, and is compared to recent micromanipulation experiments. It is shown that the interactions which stabilize the d…

cond-mat.stat-mech2001★ 6 cited

Statistical mechanics methods and phase transitions in optimization problems

O. C. Martin, R. Monasson, R. Zecchina

Recently, it has been recognized that phase transitions play an important role in the probabilistic analysis of combinatorial optimization problems. However, there are in fact many…

cond-mat.stat-mech2000★ 83 cited

Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms

Simona Cocco, Remi Monasson

The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated. 3-SAT is a representative example of hard computational tasks; it consists in know…

cond-mat.stat-mech1999★ 79 cited

Theoretical study of collective modes in DNA at ambient temperature

Simona Cocco, Remi Monasson

The instantaneous normal modes corresponding to base pair vibrations (radial modes) and twist angle fluctuations (angular modes) of a DNA molecule model at ambient temperature are…

cond-mat.stat-mech1999★ 142 cited

Statistical Mechanics of Torque Induced Denaturation of DNA

Simona Cocco, Remi Monasson

A unifying theory of the denaturation transition of DNA, driven by temperature T or induced by an external mechanical torque Gamma is presented. Our model couples the hydrogen-bond…

cond-mat.stat-mech1999★ 102 cited

A single defect approximation for localized states on random lattices

G. Biroli, R. Monasson

Geometrical disorder is present in many physical situations giving rise to eigenvalue problems. The simplest case of diffusion on a random lattice with fluctuating site connectivit…

cond-mat.stat-mech1997★ 43 cited

Entropy of particle packings : an illustration on a toy model

R. Monasson, O. Pouliquen

A toy model of particles packings is presented, which consists in arranging hexagons on a triangular lattice according to local stability rules. The number of stable packings is an…