Related papers: Beyond-mean-field fluctuations for the solution of…
A CSP with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper bound can be improved for certain natural restrictions of…
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance. In particular, the incidence graph of the CSP instance…
When the complete understanding of a complex system is not available, as, e.g., for systems considered in the real-world, we need a top-down approach to complexity. In this approach one may start with the desire to understand general…
Motivated by a {\it mean field-like} resistive behavior in magnetic fields commonly seen in various superconducting (SC) cuprates and organics with strong fluctuation, {\it quantum} SC fluctuation effects on resistive behaviors are…
The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c^n) time for arbitrary c > 1, where n denotes the number of variables. Problems like k-SAT can be viewed as special…
We study a class of sampled stochastic optimization problems, where the underlying state process has diffusive dynamics of the mean-field type. We establish the existence of optimal relaxed controls when the sample set has finite size. The…
The common spatial pattern analysis (CSP) is a widely used signal processing technique in brain-computer interface (BCI) systems to increase the signal-to-noise ratio in electroencephalogram (EEG) recordings. Despite its popularity, the…
A constraint satisfaction problem (CSP), $\textsf{Max-CSP}(\mathcal{F})$, is specified by a finite set of constraints $\mathcal{F} \subseteq \{[q]^k \to \{0,1\}\}$ for positive integers $q$ and $k$. An instance of the problem on $n$…
We propose a semiclassical framework for solving open quantum dynamics in driven-dissipative spin systems. Our method consists of generalized spin-wave approximations tailored to describing quantum trajectories unravelled from the master…
We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which type of clusters of solutions are addressed by different…
In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that…
We construct and analyze a message-passing algorithm for random constraint satisfaction problems (CSPs) at large clause density, generalizing work of El Alaoui, Montanari, and Sellke for Maximum Cut [arXiv:2111.06813] through a connection…
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known…
We consider the Hamiltonians of mean-field spin glasses, which are certain random functions $H_N$ defined on high-dimensional cubes or spheres in $\mathbb R^N$. The asymptotic maximum values of these functions were famously obtained by…
Spin-glass systems are universal models for representing many-body phenomena in statistical physics and computer science. High quality solutions of NP-hard combinatorial optimization problems can be encoded into low energy states of…
Theories of the origin of superconductivity in cuprates are dependent on an understanding of their normal state which exhibits various competing orders. Transport and thermodynamic measurements on La$_{2-x}$Sr$_x$CuO$_4$ show signatures of…
Gradient normalization and soft clipping are two popular techniques for tackling instability issues and improving convergence of stochastic gradient descent (SGD) with momentum. In this article, we study these types of methods through the…
To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…
As Phil Anderson noted long ago, frustration can be generally defined by measuring the fluctuations in the coupling energy across a plane boundary between two large blocks of material. Since that time, a number of groups have studied the…
Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…