Related papers: Multicanonical Cluster Algorithm
We show how a variant of the Hubbard model can be simulated using a meron-cluster algorithm. This provides a major improvement in our ability to determine the behavior of these types of models. We also present some results that clearly…
To further improve the performance of Monte Carlo simulations of first-order phase transitions we propose to combine the multicanonical approach with multigrid techniques. We report tests of this proposition for the $d$-dimensional $\Phi^4$…
The proposed distributed dynamic clustering algorithm enables to group agents based on their pre-selected feature states. The clusters are determined by comparing the distance of the agents' current feature states with average estimates of…
We present two diagrammatic Monte Carlo methods for quantum systems coupled with harmonic baths, whose dynamics are described by integro-differential equations. The first approach can be considered as a reformulation of Dyson series, and…
Velazquez and Curilef have proposed a methodology to extend Monte Carlo algorithms that are based on canonical ensemble. According to our previous study, their proposal allows us to overcome slow sampling problems in systems that undergo…
We show experimental results demonstrating multiple rounds of heat-bath algorithmic cooling in a 3 qubit solid-state nuclear magnetic resonance quantum information processor. By dynamically pumping entropy out of the system of interest and…
We investigate local update algorithms for the fully frustrated XY model on a square lattice. In addition to the standard updating procedures like the Metropolis or heat bath algorithm we include overrelaxation sweeps, implemented through…
We present an improved Metropolis algorithm for arbitrary hard core systems in any dimensions. In the new updating scheme the conventional Metropolis step of a single particle is replaced by a collective step of a chain of particles. For…
A new phenomenological cluster-hadronization model is presented. Its specific features are the incorporation of soft colour reconnection, a more general treatment of diquarks including their spin and giving rise to clusters with baryonic…
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…
Monte Carlo (MC) simulations of many systems, in particular those with conflicting constraints, can be considerably speeded up by using multicanonical or related methods. Some of these approaches sample with a-priori unknown weight factors.…
The investigation of phase coexistence in systems with multi-component order parameters in finite systems is discussed, and as a generic example, Monte Carlo simulations of the two-dimensional q-state Potts model (q=30) on LxL square…
In this study, we present a method for classifying dynamical systems using a hybrid approach involving recurrence plots and a convolution neural network (CNN). This is performed by obtaining the recurrence matrix of a time series generated…
We implemented a GPU based parallel code to perform Monte Carlo simulations of the two dimensional q-state Potts model. The algorithm is based on a checkerboard update scheme and assigns independent random numbers generators to each thread.…
The Cellular Potts Model (CPM) is a widely used simulation paradigm for systems of interacting cells that has been used to study scenarios ranging from plant development to morphogenesis, tumour growth and cell migration. Despite their wide…
A spin system is studied, with simultaneous permutation-symmetric Potts and spin-rotation-symmetric clock interactions, in spatial dimensions d=2 and 3. The global phase diagram is calculated from the renormalizaton-group solution with the…
A general scheme for divisive hierarchical clustering algorithms is proposed. It is made of three main steps : first a splitting procedure for the subdivision of clusters into two subclusters, second a local evaluation of the bipartitions…
For a second-order phase transition the critical energy range of interest is larger than the energy range covered by a canonical Monte Carlo simulation at the critical temperature. Such an extended energy range can be covered by performing…
When some 'entities' are related by the 'features' they share they are amenable to a bipartite network representation. Plant-pollinator ecological communities, co-authorship of scientific papers, customers and purchases, or answers in a…
In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…