Related papers: A Cluster Algorithm for the $Z_2$ Kalb-Ramond Mode…
We investigate the critical properties of the two-dimensional Z(5) vector model. For this purpose, we propose a new cluster algorithm, valid for Z(N) models with odd values of N. The two-dimensional Z(5) vector model is conjectured to…
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable. In this paper, we study two important…
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…
We perform Monte Carlo simulations using the Wolff cluster algorithm of the q=2 (Ising), 3, 4 and q=10 Potts models on dynamical phi-cubed graphs of spherical topology with up to 5000 nodes. We find that the measured critical exponents are…
This paper presents a practical global optimization algorithm for the K-center clustering problem, which aims to select K samples as the cluster centers to minimize the maximum within-cluster distance. This algorithm is based on a…
The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are…
Monte Carlo algorithms, like the Swendsen-Wang and invaded-cluster, sample the Ising and Potts models asymptotically faster than single-spin Glauber dynamics do. Here, we generalize both algorithms to sample Potts lattice gauge theory by…
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these…
An algorithm for Monte Carlo simulations is proposed in which the parameter controlling the strength of the transition becomes a dynamical variable and in which efficient transitions are achieved by cluster steps. It allows to avoid the…
We review the pertinent features of the phase diagram of the zero-field Blume-Capel model, focusing on the aspects of transition order, finite-size scaling and universality. In particular, we employ a range of Monte Carlo simulation methods…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
We introduce a fast and explainable clustering method called CLASSIX. It consists of two phases, namely a greedy aggregation phase of the sorted data into groups of nearby data points, followed by the merging of groups into clusters. The…
The Sweeny algorithm for the $Q$-state random-cluster model in two dimensions is shown to exhibit a rich mixture of critical dynamical scaling behaviors. As $Q$ decreases, the so-called critical speeding-up for non-local quantities becomes…
The two-dimensional Potts Model with 2 to 10 states is studied using a cluster algorithm to calculate fluctuations in cluster size as well as commonly used quantities like equilibrium averages and the histograms for energy and the order…
The two-dimensional Potts Model with 2 to 10 states is studied using a cluster algorithm to calculate fluctuations in cluster size as well as commonly used quantities like equilibrium averages and the histograms for energy and the order…
The effects of bond randomness on the ground-state structure, phase diagram and critical behavior of the square lattice ferromagnetic Blume-Capel (BC) model are discussed. The calculation of ground states at strong disorder and large values…
We extend the newly proposed probability-changing cluster (PCC) Monte Carlo algorithm to the study of systems with the vector order parameter. Wolff's idea of the embedded cluster formalism is used for assigning clusters. The…
Recently, Velazquez and Curilef have proposed a methodology to extend Monte Carlo algorithms based on canonical ensemble, which is aimed to overcome slow sampling problems associated with temperature-driven discontinuous phase transitions.…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
We report the results of simulations of the Lebwohl-Lasher model of the nematic-isotropic transition using a new cluster Monte Carlo algorithm. The algorithm is a modification of the Wolff algorithm for spin systems, and greatly reduces…