Related papers: The Entropy of the K-Satisfiability Problem
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
Entropy, its production, and its change in a dynamical system can be understood from either a fully stochastic dynamic description or from a deterministic dynamics exhibiting chaotic behavior. By taking the former approach based on the…
In classical Hamiltonian theories, entropy may be understood either as a statistical property of canonical systems, or as a mechanical property, that is, as a monotonic function of the phase space along trajectories. In classical mechanics,…
This paper addresses fundamental aspects of statistical mechanics such as the motivation of a classical state space with spontaneous transitions, the meaning of non-equilibrium in the context of thermalization, and the justification of…
We introduce the concept of {\em information compressibility}, $K_I$, which measures the relative change of number of available microstates of an open system in response to an energy variation. We then prove that at the time in which the…
The configurational entropy of supercooled liquids extrapolates to zero at the Kauzmann temperature, causing a crisis called the Kauzmann paradox. Here, using a class of multicomponent lattice glass models, we study a resolution of the…
We study operator complexity on various time scales with emphasis on those much larger than the scrambling period. We use, for systems with a large but finite number of degrees of freedom, the notion of K-complexity employed in…
Highly excited many-particle states in quantum systems such as nuclei, atoms, quantum dots, spin systems, quantum computers etc., can be considered as ``chaotic'' superpositions of mean-field basis states (Slater determinants, products of…
We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over…
We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…
Tropical limit for macroscopic systems in equilibrium defined as the formal limit of Boltzmann constant k going to 0 is discussed. It is shown that such tropical limit is well-adapted to analyse properties of systems with highly degenerated…
We show that the dissipation rate bounds the rate at which physical processes can be performed in stochastic systems far from equilibrium. Namely, for rare processes we prove the fundamental tradeoff $\langle \dot S_\text{e} \rangle…
The finiteness of black hole entropy suggest that spacetime is fundamentally discrete, and hints at an underlying relationship between geometry and "information". The foundation of this relationship is yet to be uncovered, but should…
Heuristic methods for solution of problems in the NP-Complete class of decision problems often reach exact solutions, but fail badly at "phase boundaries", across which the decision to be reached changes from almost always having one value…
This work presents a general unifying theoretical framework for quantum non-equilibrium systems. It is based on a re-statement of the dynamical problem as one of inferring the distribution of collision events that move a system toward…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
The limit of small entropy production is reached in relaxing systems long after preparation, and in stationary driven systems in the limit of small driving power. Surprisingly, for extended systems this limit is not in general the…
The Kolmogorov-Sinai (K-S) entropy is a central measure of complexity and chaos. Its calculation for many-body systems is an interesting and important challenge. In this paper, the evaluation is formulated by considering $N$-dimensional…
To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to each other. It is proved that under certain conditions, as r…
Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…