Related papers: Cavity Method: Message Passing from a Physics Pers…
We consider a high-dimensional random constrained optimization problem in which a set of binary variables is subjected to a linear system of equations. The cost function is a simple linear cost, measuring the Hamming distance with respect…
A detailed analysis is presented to demonstrate the capabilities of the lattice Boltzmann method. Thorough comparisons with other numerical solutions for the two-dimensional, driven cavity flow show that the lattice Boltzmann method gives…
We study spin glasses with Kac type interaction potential for small but finite inverse interaction range $\gamma$. Using the theoretical setup of coupled replicas, through the replica method we argue that the probability of overlap profiles…
Within a Kuhn-Tucker cavity method introduced in a former paper, we study optimal stability learning for situations, where in the replica formalism the replica symmetry may be broken, namely (i) the case of a simple perceptron above the…
An one-step replica-symmetry-breaking solution for finite connectivity spin-glass models with K body interaction is constructed at finite temperature using the replica method and thermodynamic constraints. In the absence of external fields,…
The Problem of Time in Quantum Gravity is analyzed from a classical presymplectic perspective. In the first part of the paper the Three Space Approach to General Relativity is introduced via the Barbour-Foster-\'O Murchadha action and the…
The solution space of a K-satisfiability (K-SAT) formula is a collection of solution clusters, each of which contains all the solutions that are mutually reachable through a sequence of single-spin flips. Knowledge of the statistical…
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…
We consider a class of random matching problems where the distance between two points has a probability law which, for a small distance l, goes like l^r. In the framework of the cavity method, in the limit of an infinite number of points,…
Penalized regression methods aim to retrieve reliable predictors among a large set of putative ones from a limited amount of measurements. In particular, penalized regression with singular penalty functions is important for sparse…
We review the main methods used to study spin glasses. In the first part, we focus on methods for fully connected models and systems defined on a tree, such as the replica method, the Thouless-Anderson-Palmer formalism, the cavity method,…
In a broad class of sparse random constraint satisfaction problems(CSP), deep heuristics from statistical physics predict that there is a condensation phase transition before the satisfiability threshold, governed by one-step replica…
Since the early 2000s physicists have developed an ingenious but non-rigorous formalism called the cavity method to put forward precise conjectures on phase transitions in random problems [Mezard, Parisi, Zecchina: Science 2002]. The cavity…
By controlling quantum fluctuations via the Falk-Bruch inequality we give the first rigorous argument for the existence of a spin-glass phase in the quantum Sherrington-Kirkpatrick model with a transverse magnetic field if the temperature…
After a rapid introduction to the physical motivations and a succinct presentation of heuristic results, this survey summarises the main mathematical results known on the Edwards-Anderson and the Sherrington-Kirkpatrick models of spin…
In this thesis four separate problems in general relativity are considered, divided into two separate themes: coordinate conditions and perfect fluid spheres. Regarding coordinate conditions we present a pedagogical discussion of how the…
The Subset Sum Problem is a fundamental NP-complete problem in cryptography and combinatorial optimization, with many real-world applications. The Random Subset Sum Problem (RSSP) is a more applicable version of subset sum, where numbers…
In this paper we study biased random K-SAT problems in which each logical variable is negated with probability $p$. This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the…
We present a new method to solve the dynamics of disordered spin systems on finite time-scales. It involves a closed driven diffusion equation for the joint spin-field distribution, with time-dependent coefficients described by a dynamical…
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause…