Related papers: Ground-State Entropy of the Random Vertex-Cover Pr…
This study focuses on the problem of finding ground states of random instances of the Sherrington-Kirkpatrick (SK) spin-glass model with Gaussian couplings. While the ground states of SK spin-glass instances can be obtained with branch and…
In a finite-connectivity spin-glass at the zero-temperature limit, long-range correlations exist among the unfrozen vertices (whose spin values being non-fixed). Such long-range frustrations are partially removed through the first-step…
We propose that chaotic Glass networks (a class of piecewise-linear Ordinary Differential Equations) are good candidates for the design of true random number generators. A Glass network design has the advantage of involving only standard…
We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased…
We study the Furstenberg-entropy realization problem for stationary actions. It is shown that for finitely supported probability measures on free groups, any a-priori possible entropy value can be realized as the entropy of an ergodic…
Entropy regularization is an efficient technique for encouraging exploration and preventing a premature convergence of (vanilla) policy gradient methods in reinforcement learning (RL). However, the theoretical understanding of…
The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a…
We review recent progress in the study of the vertex-cover problem (VC). VC belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science. On ensembles of random graphs, VC…
We discuss replica symmetry breaking (RSB) in spin glasses. We update work in this area, from both the analytical and numerical points of view. We give particular attention to the difficulties stressed by Newman and Stein concerning the…
Entropy is a central concept in physics, but can be challenging to calculate even for systems that are easily simulated. This is exacerbated out of equilibrium, where generally little is known about the distribution characterizing simulated…
We describe a method to estimate R\'enyi entanglement entropy of a spin system, which is based on the replica trick and generative neural networks with explicit probability estimation. It can be extended to any spin system or lattice field…
We use large-$N$ diagrammatic techniques to calculate the relative entropy of symmetric random states drawn from the Wishart ensemble. These methods are specifically designed for symmetric sectors, allowing us to determine the relative…
We investigate the performance of flat-histogram methods based on a multicanonical ensemble and the Wang-Landau algorithm for the three-dimensional +/- J spin glass by measuring round-trip times in the energy range between the…
A setup that simulates ground states of spin graphs would allow one to solve computationally hard optimisation problems efficiently. Current optical setups to this goal have difficulties decoupling the amplitude and phase degrees of freedom…
Here we study the two-dimensional Kaya-Berker model, with a site occupancy p of one sub lattice, by using a polynomial-time exact ground-state algorithm. Thus, we were able to obtain T=0 results in exact equilibrium for rather large system…
A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at least one vertex of each cycle of the graph. The feedback vertex set problem consists of constructing a FVS of size less than a certain given value.…
We study the symmetry-resolved genuine multi-entropy, a measure that captures genuine multi-partite entanglement, in Haar random states and random graph states in the presence of a conserved quantity. For Haar random states, we derive…
We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…
We combine two methods for the lossless compression of unlabeled graphs - entropy compressing adjacency lists and computing canonical names for vertices - and solve an ensuing novel optimisation problem: Minimum-Entropy Tree-Extraction…
We calculate the half-chain entanglement entropy of the ground state in the one-dimensional spinless fermion model. Considering a tiny corner of the Hilbert space represented by matrix product states, we efficiently find the ground state by…