Related papers: Invaded cluster algorithm for a tricritical point …
Recently, Ang--Cai--Sun--Wu (2024) determined the three-point connectivity constant for two-dimensional critical percolation, confirming a prediction of Delfino and Viti (2010). In this paper, we address the analogous problem for planar…
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…
We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…
k-core percolation is an extension of the concept of classical percolation and is particularly relevant to understand the resilience of complex networks under random damage. A new analytical formalism has been recently proposed to deal with…
We investigate the damage spreading effect in the Fortuin-Kasteleyn random cluster model for 2- and 3-dimensional grids with periodic boundary. For 2D the damage function has a global maximum at $p=\sqrt{q}/(1+\sqrt{q})$ for all $q>0$ and…
We conjecture an exact form for an universal ratio of four-point cluster connectivities in the critical two-dimensional $Q$-color Potts model. We also provide analogous results for the limit $Q\rightarrow 1$ that corresponds to percolation…
We consider the densities of clusters, at the percolation point of a two-dimensional system, which are anchored in various ways to an edge. These quantities are calculated by use of conformal field theory and computer simulations. We find…
Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerates clusters of objects in all subspaces of a dataset. It tends…
An analysis of water clustering is used to study the quasi-2D percolation transition of water adsorbed at planar hydrophilic surfaces. Above the critical temperature of the layering transition (quasi-2D liquid-vapor phase transition of…
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…
Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…
The two-dimensional Z(5) vector model is investigated through the determination of critical points and one critical index. To this purpose a new cluster algorithm has been developed valid for 2D Z(N) models with odd values of N. Results are…
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…
Simulating non-wetting fluid invasion in volumetric images of porous materials is of broad interest in applications as diverse as electrochemical devices and CO2 sequestration. Among available methods, image-based algorithms offer much…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^d$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,\dots,…
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
By means of a multi-scale analysis we describe the typical geometrical structure of the clusters under the FK measure in random media. Our result holds in any dimension greater or equal to 2 provided that slab percolation occurs under the…
We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of $m$ points in $n$ dimensions, $n,m \rightarrow \infty$ and $\alpha = m/n$ stays finite. Using exact but non-rigorous methods…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…