Related papers: Threshold Saturation in Spatially Coupled Constrai…
We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a one-dimensional real-valued state. This is extended to a proof of the threshold saturation…
Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead of the worst case one. The interplay between statistical…
Much of the recent work on random constraint satisfaction problems has been inspired by ingenious but non-rigorous approaches from physics. The physics predictions typically come in the form of distributional fixed point problems that are…
Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\frac{c}{n})$ graph 3-coloring, in the hard region of…
We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarity between different solutions found on the same problem…
An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…
In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which…
Models of confluent tissues are built out of tessellations of the space (both in two and three dimensions) in which the cost function is constructed in such a way that individual cells try to optimize their volume and surface in order to…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
Various phase transitions in models for coupled charge-density waves are investigated by means of the $\epsilon$-expansion, mean-field theory, and Monte Carlo simulations. At zero temperature the effective action for the system with…
In this paper we study the influence of sample geometry on the measurement of pressure-saturation relationships, by analyzing the drainage of a two-phase flow from a quasi-2D random porous medium. The medium is transparent, which allows for…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
We study real space condensation in aggregation-fragmentation models where the total mass is not conserved, as in phenomena like cloud formation and intracellular trafficking. We study the scaling properties of the system with influx and…
A satisfiability (SAT-UNSAT) transition takes place for many optimization problems when the number of constraints, graphically represented by links between variables nodes, is brought above some threshold. If the network of constraints is…
The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…
Random Constraint Satisfaction Problems exhibit several phase transitions when their density of constraints is varied. One of these threshold phenomena, known as the clustering or dynamic transition, corresponds to a transition for an…
The phase ordering dynamics of coupled chaotic maps on fractal networks are investigated. The statistical properties of the systems are characterized by means of the persistence probability of equivalent spin variables that define the…
The formalism developed in Refs.\cite{Guo:2023ecc,Guo:2024zal} that connects integrated correlation function of a trapped two-particle system to infinite volume scattering phase shift is further extended to coupled-channel systems in the…
We consider a random geometric graph with vertices sampled from a probability measure supported on $\mathbb R^d$, and study its connectivity. We show the graph is typically disconnected, unless the sampling density has superexponential…
We study an exactly solvable version of the famous random Boolean satisfiability problem, the so called random XOR-SAT problem. Rare events are shown to affect the combinatorial ``phase diagram'' leading to a coexistence of solvable and…