{'fraction_non_alphanumeric': 0.05122324159021407, 'fraction_numerical': 0.008409785932721712, 'mean_word_length': 4.716157205240175, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient parallel implementation of Potts model

In this work we present a different approach to simulate the Ferromagnetic Potts model [1] described by Renfrey B. Potts in 1952 and it is a generalization of the Ising [2] model. It is well-known that the Potts model has a disadvantage when it is implemented using a Monte Carlo simulation with a standard Metropolis algorithm. Many parallel algorithms have recently been developed to reduce this ”drawback” [3,4]. The problem of these algorithms is that they are much more difficult to parallelize efficiently. Our work describes a parallel Monte Carlo solution, using a C and an MPI library, which is more efficient than the traditional methods. The Potts model consists of spins that are placed on a lattice; the lattice is usually taken to be a two-dimensional rectangular Euclidean lattice, but is often generalized to other dimensions or other lattices. The Hamiltonian function is defined as follows: H = J ∑ (i,j),(i′,j′) 1− δσ(i,j)σ(i′,j′) (1) where J is a positive constant, δ is the Kronecker delta, 1 < δ(i,j) < Nd denotes the orientation of the spin at (i, j), Nd is the number of possible domains in the system at the begining of the simulation and (i, j), (i′, j′) denotes the first neighbourhood area. The probability function is defined as: