相关论文: Critical points of the random cluster model with N…

Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…

How does the percolation transition behave in the absence of quenched randomness? To address this question, we study two nonrandom self-dual quasiperiodic models of square-lattice bond percolation. In both models, the critical point has…

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…

In conventional site percolation, all lattice sites are occupied with the same probability. For a bipartite lattice, sublattice-selective percolation instead involves two independent occupation probabilities, depending on the sublattice to…

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…

A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…

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…

It is proposed that the $O(n)$ spin and geometrical percolation models can help to study the QCD phase diagram due to the universality properties of the phase transition. In this paper, correlations and fluctuations of various sizes of…

Mitra et al. [Phys. Rev. E 99 (2019) 012117] proposed a new percolation model that includes distortion in the square lattice and concluded that it may belong to the same universality class as the ordinary percolation. But the conclusion is…

This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…

We consider the random cluster model with parameter $q<1$, for which the FKG inequalities are not valid. On the square lattice, stochastic comparison with Bernoulli percolation implies that the model is subcritical (respectively…

We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…

We propose two schemes to achieve fast realizations of spatially correlated percolation models. The schemes are shown to be efficient in complementary regimes of correlation phase space. They are combined with a generalized Newman-Ziff…

We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.

In this paper, we prove sharpness of the phase transition for the random-cluster model in summable positive external fields, with cluster weight q=2,3,..., on the hypercubic lattice. That is, there exists some nontrivial critical parameter…

In phase transition phenomena, the estimation of the critical point is crucial for the calculation of the various critical exponents and the determination of the universality class they belong to. However, this is not an easy task, since a…

Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…

We consider independent long-range percolation models on locally finite vertex-transitive graphs. Using coupling ideas we prove strict monotonicity of the critical points with respect to local perturbations in the connection function,…

We have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked…

We propose a method to numerically determine the location of a critical point in general systems using the finite-size scaling of Lee-Yang zeros. This method makes use of the fact that the ratios of Lee-Yang zeros on various spatial volumes…