Related papers: Optimal Cooperation and Submodularity for Computin…
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described…
The $q$-state Potts model is a fundamental model in statistical physics that generalizes the Ising model and plays a key role in the study of phase transitions, critical phenomena, complex systems, and combinatorial optimization. Sampling…
Combinatorial optimization problems pose significant computational challenges across various fields, from logistics to cryptography. Traditional computational methods often struggle with their exponential complexity, motivating exploration…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19,20]. It identifies a part of an optimal solution by running $k$ maxflow…
Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initial state towards states with better values of the optimand,…
In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…
The ferromagnetic q-state Potts model on a square lattice is analyzed, for q>4, through an elaborate version of the operatorial variational method. In the variational approach proposed in the paper, the duality relations are exactly…
Efficiently optimizing Nondeterministic Polynomial time (NP) problems in polynomial time has profound implications in many domains. CMOS oscillator networks have been shown to be effective and efficient in approximating certain NP-hard…
The finite lattice method of series expansion is generalised to the $q$-state Potts model on the simple cubic lattice. It is found that the computational effort grows exponentially with the square of the number of series terms obtained,…
Local Operations enhancing the entanglement of bipartite quantum states are of great interest in quantum information processing. Subject of this paper are local selective operations acting on single copies of states. Such operations can…
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…
In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a…
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…
We develop a parallel algorithm that calculates the exact partition function of a lattice polymer, by enumerating the number of conformations for each energy level. An efficient parallelization of the calculation is achieved by classifying…
Often times, individuals working together as a team can solve hard problems beyond the capability of any individual in the team. Cooperative optimization is a newly proposed general method for attacking hard optimization problems inspired…
The Q-state Potts model can be extended to noninteger and even complex Q in the FK representation. In the FK representation the partition function,Z(Q,a), is a polynomial in Q and v=a-1(a=e^-T) and the coefficients of this…
The phase transition in the q-state Potts model with homogeneous ferromagnetic couplings is strongly first order for large q, while is rounded in the presence of quenched disorder. Here we study this phenomenon on different two-dimensional…
The finite lattice method of series expansion has been used to extend low-temperature series for the partition function, order parameter and susceptibility of the $q$-state Potts model to order $z^{56}$ (i.e. $u^{28}$), $z^{47}$, $z^{43}$,…
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…