Related papers: Vertex cover problem studied by cavity method: Ana…
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 study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced by the vertices of a dominating set should be a connected…
Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph. In this paper, a learning automaton based algorithm is proposed to find minimum vertex cover in graph. In the proposed…
The free energy and the specific heat of the two-dimensional Gaussian random bond Ising model on a square lattice are found with high accuracy using graph expansion method. At low temperatures the specific heat reveals a zero-temperature…
We present a general method for obtaining a lower bound for the ground state entropy density of the Ising Model with nearest neighbor interactions. Then, using this method, and with a random coupling constant configuration, we obtain a…
During the past decade, phase-transition phenomena in the random 3-satisfiability (3-SAT) problem has been intensively studied by statistical physics methods. In this work, we study the random 3-SAT problem by the mean-field first-step…
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…
In this paper the three dimensional random field Ising model is studied at both zero temperature and positive temperature. Critical exponents are extracted at zero temperature by finite size scaling analysis of large discontinuities in the…
We present analytical results for the strongly anisotropic random field Ising model, consisting of weakly interacting spin chains. We combine the mean-field treatment of interchain interactions with an analytical calculation of the average…
We investigate the finite size corrections to the equilibrium magnetization of an Ising model on a random graph with $N$ nodes and $N^{\gamma}$ edges, with $1 < \gamma \leq 2$. By conveniently rescaling the coupling constant, the free…
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it…
The paper presents an algorithm for minimum vertex cover problem, which is an NP-Complete problem. The algorithm computes a minimum vertex cover of each input simple graph. Tested by the attached MATLAB programs, Stage 1 of the algorithm is…
We study the thermodynamic properties of spin systems on small-world hypergraphs, obtained by superimposing sparse Poisson random graphs with p-spin interactions onto a one-dimensional Ising chain with nearest-neighbor interactions. We use…
We study minimum vertex cover problems on random \alpha-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase…
We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent information. We present a surprising structural…
A vertex cover on a graph is a set of vertices in which each edge of the graph is adjacent to at least one vertex in the set. The Minimal Vertex Cover (MVC) Problem concerns finding vertex covers with a smallest cardinality. The MVC problem…
We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based on weighted graph states and superpositions thereof. These…
In this article, new results are presented for the zero-temperature ground-state properties of the spin-half transverse Ising model on various lattices using three different approximate techniques. These are, respectively, the coupled…
Using methods of statistical physics, we analyse the error of learning couplings in large Ising models from independent data (the inverse Ising problem). We concentrate on learning based on local cost functions, such as the…
In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular…