Related papers: Graphical representations and cluster algorithms f…
A system defined by two coupled Ising models, with a bimodal random field acting in one of them, is investigated. The interactions among variables of each Ising system are infinite-ranged, a limit where mean field becomes exact. This model…
The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…
An advanced technique for a two-dimensional real time visualization of cluster beams in vacuum as well as of the overlap volume of cluster beams with particle accelerator beams is presented. The detection system consists of an array of…
We present a novel clustering algorithm, visClust, that is based on lower dimensional data representations and visual interpretation. Thereto, we design a transformation that allows the data to be represented by a binary integer array…
We contribute to the mathematical theory of the design of low temperature Ising machines, a type of experimental probabilistic computing device implementing the Ising model. Encoding the output of a function in the ground state of a…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
We consider phase separation on the strip for the two-dimensional Ising model in the near-critical region. Within the framework of field theory, we find exact analytic results for certain two- and three-point correlation functions of the…
The Ising model is of prime importance in the field of statistical mechanics. Here we show that Ising-type interactions can be realized in periodically-driven circuits of stochastic binary resistors with memory. A key feature of our…
On locally tree-like random graphs, we relate the random cluster model with external magnetic fields and $q\geq 2$ to Ising models with vertex-dependent external fields. The fact that one can formulate general random cluster models in terms…
Combinatorial optimization algorithms which compute exact ground state configurations in disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using arguments based on the physical picture of…
The $q$-neighbor Ising model is investigated on homogeneous random graphs with a fraction of edges associated randomly with antiferromagnetic exchange integrals and the remaining edges with ferromagnetic ones. It is a nonequilibrium model…
We study the critical line of the triangular Ising antiferromagnet in an external magnetic field by means of a finite-size analysis of results obtained by transfer-matrix and Monte Carlo techniques. We compare the shape of the critical line…
In computer vision, the estimation of the fundamental matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera trajectory…
Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo…
Traditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster analysis is a popular task within graph analysis, yet there is…
We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even though our algorithm is purely classical, it is designed by…
The invaded cluster approach is extended to 2D Potts model with annealed vacancies by using the random-cluster representation. Geometrical arguments are used to propose the algorithm which converges to the tricritical point in the…
Many datasets take the form of a bipartite graph where two types of nodes are connected by relationships, like the movies watched by a user or the tags associated with a file. The partitioning of the bipartite graph could be used to fasten…
In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of partitioning the set of nodes into a fixed number of subsets with…