R. Monasson

From MaRDI portal
Person:1668955

Available identifiers

zbMath Open monasson.remiMaRDI QIDQ1668955

List of research outcomes





PublicationDate of PublicationType
Evolutionary dynamics of a lattice dimer: a toy model for stability vs. affinity trade-offs in proteins2023-11-07Paper
‘Place-cell’ emergence and learning of invariant data with restricted Boltzmann machines: breaking and dynamical restoration of continuous symmetries in the weight space2023-01-12Paper
From Statistical Physics to Data-Driven Modelling2022-10-24Paper
Statistical physics and representations in real and artificial neural networks2022-06-28Paper
An evolution-based model for designing chorismate mutase enzymes2022-01-21Paper
Inferring epistasis from genomic data with comparable mutation and outcrossing rate2021-09-24Paper
Low-Dimensional Manifolds Support Multiplexed Integrations in Recurrent Neural Networks2021-07-30Paper
https://portal.mardi4nfdi.de/entity/Q51347372020-11-17Paper
Can grid cell ensembles represent multiple spaces?2020-02-07Paper
Learning Compositional Representations of Interacting Systems with Restricted Boltzmann Machines: Comparative Study of Lattice Proteins2020-02-07Paper
Von Neumann’s expanding model on random graphs2019-10-22Paper
Innovation rather than improvement: a solvable high-dimensional model highlights the limitations of scalar fitness2018-08-29Paper
Neural assemblies revealed by inferred connectivity-based models of prefrontal cortex recordings2018-03-14Paper
Determining computational complexity from characteristic ‘phase transitions’2017-09-01Paper
On the entropy of protein families2016-06-01Paper
Learning probabilities from random observables in high dimensions: the maximum entropy distribution and others2015-12-03Paper
Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests2012-06-07Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
Small-correlation expansions for the inverse Ising problem2009-02-16Paper
https://portal.mardi4nfdi.de/entity/Q35971492009-02-09Paper
Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms forK-SAT at large clause-to-variable ratios2007-03-07Paper
On large deviation properties of Erdős-Rényi random graphs2006-11-27Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
https://portal.mardi4nfdi.de/entity/Q33707832006-02-08Paper
The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic2005-10-18Paper
Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT2005-05-13Paper
https://portal.mardi4nfdi.de/entity/Q46685782005-04-19Paper
Circuits in random graphs: from local trees to global loops2005-02-01Paper
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances2004-08-10Paper
Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem2002-05-02Paper
Statistical mechanics methods and phase transitions in optimization problems2002-03-03Paper
Statistical physics analysis of the backtrack resolution of random 3-SAT instances2001-09-24Paper
Relationship between long timescales and the static free-energy in the Hopfield model2000-08-13Paper
Entropy of theK-Satisfiability Problem2000-07-16Paper
Optimization problems and replica symmetry breaking in finite connectivity spin glasses2000-06-26Paper
Tricritical points in random combinatorics: the -SAT case2000-04-06Paper
https://portal.mardi4nfdi.de/entity/Q47047991999-11-25Paper
A mean-field hard-spheres model of glass1999-04-27Paper
How (super) rough is the glassy phase of a crystalline surface with a disordered substrate?1997-01-23Paper
Properties of neural networks storing spatially correlated patterns1993-01-17Paper
On the capacity of neural networks with binary weights1992-09-27Paper

Research outcomes over time

This page was built for person: R. Monasson