Related papers: Order-to-chaos transition in the hardness of rando…
What is chaos? Despite several decades of research on this ubiquitous and fundamental phenomenon there is yet no agreed-upon answer to this question. Recently, it was realized that all stochastic and deterministic differential equations,…
This work theoretically investigates the transition from topology to chaos in a periodically driven system consisting of a quantum top coupled to a spin-1/2 particle. The system is driven by two alternating interaction kicks per period. For…
We study the problem of satisfiability of randomly chosen clauses, each with K Boolean variables. Using the cavity method at zero temperature, we find the phase diagram for the K=3 case. We show the existence of an intermediate phase in the…
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler. Through the analysis of the SAT problem using the elements,…
Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds…
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our variational scheme accurately reproduces the known replica…
This paper is concerned with the complex behavior arising in satisfiability problems. We present a new statistical physics-based characterization of the satisfiability problem. Specifically, we design an algorithm that is able to produce…
Natural systems often exhibit chaotic behavior in their space-time evolution. Systems transiting between chaos and order manifest a potential to compute, as shown with cellular automata and artificial neural networks. We demonstrate that…
We study the competing order and chaos in a first-order quantum phase transition with a high barrier. The boson model Hamiltonian employed, interpolates between its U(5) (spherical) and SU(3) (deformed) limits. A classical analysis reveals…
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular, when the maximum clause length is 3, this model displays a…
Continuous-time systems with switch-like behaviour occur in chemical kinetics, gene regulatory networks and neural networks. Networks with hard switching, as a limiting case of smooth sigmoidal switching, retain the richest possible range…
A heuristic model procedure for determining satisfiability of CNF-formulae is set up and described by nonlinear recursion relations for m (number of clauses), n (number of variables) and clause filling k. The system mimicked by the…
The route to chaos and phase dynamics in a rotating shallow-water model were rigorously examined using a five-mode Galerkin truncated system with complex variables. This system is valuable for investigating how large/meso-scales destabilize…
Fast scrambling, quantified by the exponential initial growth of Out-of-Time-Ordered-Correlators (OTOCs), is the ability to efficiently spread quantum correlations among the degrees of freedom of interacting systems, and constitutes a…
Partly on the basis of heuristic arguments from physics it has been suggested that the performance of certain types of algorithms on random $k$-SAT formulas is linked to phase transitions that affect the geometry of the set of satisfying…
The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…
Quantum chaos refers to signatures of classical chaos found in the quantum domain. Recently, it has become common to equate the exponential behavior of out-of-time order correlators (OTOCs) with quantum chaos. The quantum-classical…
We report the results of numerical simulations for a model of a one component plasma (a system of N point electrons with mutual Coulomb interactions) in a uniform stationary magnetic field. We take N up to 512, with periodic boundary…
We explore the concept of scaling invariance in a type of dynamical systems that undergo a transition from order (regularity) to disorder (chaos). The systems are described by a two-dimensional, nonlinear mapping that preserves the area in…
We introduce the $\alpha$-Gauss-Logistic map, a new nonlinear dynamics constructed by composing the logistic and $\alpha$-Gauss maps. Explicitly, our model is given by $x_{t+1} = f_L(x_t)x_t^{-\alpha} - \lfloor f_L(x_t)x_t^{-\alpha} \rfloor…