Related papers: Geometric properties of the complete-graph Ising m…
We consider the graphical representations of the Ising model on tree-like graphs. We construct a class of graphs on which the loop $\mathrm{O}(1)$ model and the single random current exhibit a non-unique phase transition with respect to the…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
We numerically investigate the heterogeneity in cluster sizes in the two-dimensional Ising model and verify its scaling form recently proposed in the context of percolation problems [Phys. Rev. E 84, 010101(R) (2011)]. The scaling exponents…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
The problem of N interacting spins on a lattice is equivalent to one of N clusters linked in a specific manner. The energy of any configuration of spins can be expressed in terms of the energy levels of this cluster. A new expression is…
We discuss the interrelation between phase transitions in interacting lattice or continuum models, and the existence of infinite clusters in suitable random-graph models. In particular, we describe a random-geometric approach to the phase…
Community detection in graphs is a problem that is likely to be relevant whenever network data appears, and consequently the problem has received much attention with many different methods and algorithms applied. However, many of these…
We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…
In random percolation one finds that the mean field regime above the upper critical dimension can simply be explained through the coexistence of infinite percolating clusters at the critical point. Because of the mapping between percolation…
We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…
We use the cavity method to study parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single site probabilities of paths propagating along the edges of the graph. These equations…
We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare…
We study the phase diagram of a class of models in which a generalized cluster interaction can be quenched by Ising exchange interaction and external magnetic field. We characterize the various phases through winding numbers. They may be…
A new technique is demonstrated for carrying out exact positive-P phase-space simulations of the coherent Ising machine quantum computer. By suitable design of the coupling matrix, general hard optimization problems can be solved. Here,…
We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…
The size distribution of geometrical spin clusters is exactly found for the one dimensional Ising model of finite extent. For the values of lattice constant $\beta$ above some "critical value" $\beta_c$ the found size distribution…
The goal of this paper is to exhibit a deep relation between the partition function of the Ising model on a planar trivalent graph and the generating series of the spin network evaluations on the same graph. We provide respectively a…
Initially, we derive a nonlinear integral equation for the vacuum counting function of the spin 1/2-XYZ chain in the {\it disordered regime}, thus paralleling similar results by Kl\"umper \cite{KLU}, achieved through a different technique…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…
The site-random Ising spin glass model is investigated. We find a rigorous symmetry for the SG correlation and the free energy, which provides some restrictions in the phase diagram. Using the defect energies calculated by the numerical…