Related papers: Ground-State Entropy of the Random Vertex-Cover Pr…
We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems…
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…
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 study the efficiency of parallel tempering Monte Carlo technique for calculating true ground states of the Edwards-Anderson spin glass model. Bimodal and Gaussian bond distributions were considered in two and three-dimensional lattices.…
We consider the problem of algorithmically sampling from the Gibbs measure of a mixed $p$-spin spherical spin glass. We give a polynomial-time algorithm that samples from the Gibbs measure up to vanishing total variation error, for any…
We study minimum entropy submodular optimization, a common generalization of the minimum entropy set cover problem, studied earlier by Cardinal et al., and the submodular set cover problem. We give a general bound of the approximation…
The nature of the spin glass state is investigated by studying changes to the ground state when a weak perturbation is applied to the bulk of the system. We consider short range models in three and four dimensions and the infinite range…
The policy gradient theorem is defined based on an objective with respect to the initial distribution over states. In the discounted case, this results in policies that are optimal for one distribution over initial states, but may not be…
The minimal dominating set for a digraph(directed graph)is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution for a given graph that…
We study $p$-spin glass models on regular random graphs. By analyzing the Franz-Parisi potential with a two-body cavity field approximation under the replica symmetric ansatz, we obtain a good approximation of the 1RSB transition…
We show that a simple geometric result suffices to derive the form of the optimal solution in a large class of finite and infinite-dimensional maximum entropy problems concerning probability distributions, spectral densities and covariance…
A zero temperature dynamics of Ising spin glasses and ferromagnets on random graphs of finite connectivity is considered, like granular media these systems have an extensive entropy of metastable states. We consider the problem of what…
The quasi-local notion of an isolated horizon is employed to study the entropy of black holes without any particular symmetry in loop quantum gravity. The idea of characterizing the shape of a horizon by a sequence of local areas is…
We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…
In a recent Letter [Europhys. Lett. 40, 429 (1997)], Hartmann presented results for the structure of the degenerate ground states of the three-dimensional +/- J spin glass model obtained using a genetic algorithm. In this Comment, I argue…
In a recent article [Phys. Rev. Lett. 97 (2006), 107206], we have presented a class of states which is suitable as a variational set to find ground states in spin systems of arbitrary spatial dimension and with long-range entanglement.…
Exact ground states are calculated for the Sherrington-Kirkpatrick (SK) spin-glass containing up to N=90 spins. A ground-state energy per spin $e^{\infty}_0 = - 0.7637 \pm 0.0004$ is found from the $N$ dependence of the misfit parameter,…
We introduce the Minimum Entropy Method, a simple statistical technique for constraining the Milky Way gravitational potential and simultaneously testing different gravity theories directly from 6D phase-space surveys and without adopting…