Nobel lecture: Multiple equilibria

G Parisi - Reviews of Modern Physics, 2023 - APS
This is an extended version of my Nobel Lecture, delivered on December 8, 2021. I will
recall the genesis of the concept of multiple equilibria in natural sciences. I will then describe …

Statistical physics of inference: Thresholds and algorithms

L Zdeborová, F Krzakala - Advances in Physics, 2016 - Taylor & Francis
Many questions of fundamental interest in today's science can be formulated as inference
problems: some partial, or noisy, observations are performed over a set of variables and the …

Critical phenomena in complex networks

SN Dorogovtsev, AV Goltsev, JFF Mendes - Reviews of Modern Physics, 2008 - APS
The combination of the compactness of networks, featuring small diameters, and their
complex architectures results in a variety of critical effects dramatically different from those in …

Modularity from fluctuations in random graphs and complex networks

R Guimera, M Sales-Pardo, LAN Amaral - Physical Review E—Statistical …, 2004 - APS
The mechanisms by which modularity emerges in complex networks are not well understood
but recent reports have suggested that modularity may arise from evolutionary selection. We …

Survey propagation: An algorithm for satisfiability

A Braunstein, M Mézard… - Random Structures & …, 2005 - Wiley Online Library
We study the satisfiability of randomly generated formulas formed by M clauses of exactly K
literals over N Boolean variables. For a given value of N the problem is known to be most …

Gibbs states and the set of solutions of random constraint satisfaction problems

F Krzakała, A Montanari… - Proceedings of the …, 2007 - National Acad Sciences
An instance of a random constraint satisfaction problem defines a random subset 𝒮 (the set
of solutions) of a large product space XN (the set of assignments). We consider two …

Phase transitions in the coloring of random graphs

L Zdeborová, F Krząkała - Physical Review E—Statistical, Nonlinear, and Soft …, 2007 - APS
We consider the problem of coloring the vertices of a large sparse random graph with a
given number of colors so that no adjacent vertices have the same color. Using the cavity …

Quantum optimization for the graph coloring problem with space-efficient embedding

Z Tabi, KH El-Safty, Z Kallus, P Hága… - 2020 IEEE …, 2020 - ieeexplore.ieee.org
Current quantum computing devices have different strengths and weaknesses depending
on their architectures. This means that flexible approaches to circuit design are necessary …

Extremal optimization

S Boettcher - New optimization algorithms in physics, 2004 - Wiley Online Library
Physical processes have inspired many optimization heuristics. Most famously, variants of
simulated annealing and genetic algorithms are widely used tools for the exploration of …

Rigorous inequalities between length and time scales in glassy systems

A Montanari, G Semerjian - Journal of statistical physics, 2006 - Springer
Glassy systems are characterized by an extremely sluggish dynamics without any simple
sign of long range order. It is a debated question whether a correct description of such …