相关论文: Invaded cluster algorithm for equilibrium critical…

Rigidity Percolation is a crucial framework for describing rigidity transitions in amorphous systems. We present a new, efficient algorithm to study central-force Rigidity Percolation in two dimensions. This algorithm combines the Pebble…

We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…

The Meron Cluster algorithm solves the sign problem in a class of interacting fermion lattice models with a chiral phase transition. Within this framework, we study the geometrical features of the clusters built by the algorithm, that…

We propose an algorithm to obtain numerically approximate solutions of the direct Ising problem, that is, to compute the free energy and the equilibrium observables of spin systems with arbitrary two-spin interactions. To this purpose we…

Simulations of the two-dimensional Ising and 3-state Potts models at their critical points are performed using the invaded cluster (IC) algorithm. It is argued that observables measured on a sub-lattice of size l should exhibit a crossover…

A cluster mean-field method is introduced and the applications to the Ising and Heisenberg models are demonstrated. We divide the lattice sites into clusters whose size and shape are selected so that the equivalence of all sites in a…

We discuss recently introduced numerical linked-cluster (NLC) algorithms that allow one to obtain temperature-dependent properties of quantum lattice models, in the thermodynamic limit, from exact diagonalization of finite clusters. We…

A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…

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…

We present a comparison between two optical cluster finding methods: a matched filter algorithm using galaxy angular coordinates and magnitudes, and a percolation algorithm using also redshift information. We test the algorithms on two mock…

We introduce a simple, intuitive and yet powerful algorithm for clustering analysis. This algorithm is an iterative process on the sample space, which arises as an extension of the iteratively generated correlation matrices. It allows for…

This paper presents a systematic study of the application of convolutional neural networks (CNNs) as an efficient and versatile tool for the analysis of critical and low-temperature phase states in spin system models. The problem of…

An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…

Critical phase transitions have proven to be a powerful concept to capture the phenomenology of many systems, including deeply non-equilibrium ones like living systems. The study of these phase transitions has overwhelmingly relied on…

Finite systems in confining potentials are known to undergo structural transitions similar to phase transitions. However, these systems are inhomogeneous, and their "melting" point may depend on the position in the trap and vary with the…

The Widom-Rowlinson model of a fluid mixture is studied using a new cluster algorithm that is a generalization of the invaded cluster algorithm previously applied to Potts models. Our estimate of the critical exponents for the two-component…

We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling…

Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…

The fractal structure and scaling properties of a 2d slice of the 3d Ising model is studied using Monte Carlo techniques. The percolation transition of geometric spin (GS) clusters is found to occur at the Curie point, reflecting the…

In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…