Related papers: Ground-State Entropy of the Random Vertex-Cover Pr…
Counting the solution number of combinational optimization problems is an important topic in the study of computational complexity, especially on the #P-complete complexity class. In this paper, we first investigate some organizations of…
This PhD thesis is organized as follows. In the first two chapters I will review some basic notions of statistical physics of disordered systems, such as random graph theory, the mean-field approximation, spin glasses and combinatorial…
The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \mth{c} is larger than \mth{2.7183}, groups of max-matching patterns which differ greatly from…
We study the chaotic behavior of the Gibbs state of spin-glasses under the application of an external magnetic field, in the crossover region where the field intensity scales proportional to $1/\sqrt{N}$, being $N$ the system size. We show…
We calculate the density of states of a binary Lennard-Jones glass using a recently proposed Monte Carlo algorithm. Unlike traditional molecular simulation approaches, the algorithm samples distinct configurations according to…
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…
Conditional graph entropy is known to be the minimal rate for a natural functional compression problem with side information at the receiver. In this paper we show that it can be formulated as an alternating minimization problem, which…
We study random-field xy spin model at T=0 numerically on lattices of up to 1000 x 1000 x 1000 spins with the accent on the weak random field. Our numerical method is physically equivalent to slow cooling in which the system is gradually…
We propose a method for systematically finding ground states of spinor Bose-Einstein condensates by utilizing symmetry properties of the system. By this method, we can find not only an inert state, whose symmetry is maximal in the manifold…
We study the metastable states in Ising spin models with orthogonal interaction matrices. We focus on three realizations of this model, the random case and two non-random cases, i.e.\ the fully-frustrated model on an infinite dimensional…
The use of combinatorial optimization algorithms has contributed substantially to the major progress that has occurred in recent years in the understanding of the physics of disordered systems, such as the random-field Ising model. While…
The goal in the stochastic vertex cover problem is to obtain an approximately minimum vertex cover for a graph $G^\star$ that is realized by sampling each edge independently with some probability $p\in (0, 1]$ in a base graph $G = (V, E)$.…
Most of the analytical studies on spin glasses are performed by using mean-field theory and renormalization group analysis. Analytical studies on finite-dimensional spin glasses are very challenging. In this short note, a possible exten-…
We study the Minimum Sum Vertex Cover problem, which asks for an ordering of vertices in a graph that minimizes the total cover time of edges. In particular, n vertices of the graph are visited according to an ordering, and for each edge…
Generally, a graph G, an independent set is a subset S of vertices in G such that no two vertices in S are adjacent (connected by an edge) and a vertex cover is a subset S of vertices such that each edge of G has at least one of its…
We propose a new method for exact analytical calculation of the ground-state energy of the Ising spin glass on strips. An outstanding advantage of this method over the numerical transfer matrix technique is that the energy is obtained for…
Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time…
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp…
We employ a novel algorithm using a quasi-exact embedded-cluster matching technique as minimization method within a genetic algorithm to reliably obtain numerically exact ground states of the Edwards-Anderson XY spin glass model with…
We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…