Related papers: Cluster size in bond percolation on the Platonic s…
A key challenge in multiphase flow through porous media is to understand and predict the conditions under which trapped fluid clusters become mobilized. Here, we investigate the stability of such clusters in two-phase flow and present a…
Magic numbers in finite particle systems correspond to specific system sizes that allow configurations with low free energy, often exhibiting closed surface shells to maximize the number of nearest neighbors. Since their discovery in atomic…
The formation history of rich clusters is investigated using a hybrid N-body simulation in which high spatial and mass resolution can be achieved self-consistently within a small region of a very large volume. The evolution of three massive…
A methodology is developed to identify clusters in a bulk phase which are topologically equivalent to certain reference clusters. The selected reference clusters are the Morse clusters with 13 or less atoms and the 13 atom clusters found in…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
Guidelines for growing insulin crystals of a uniform size are formulated and tested experimentally. A simple theoretical model based on the balance of matter predicts the time evolution of the crystal size and supersaturation. The time…
Dynamical behavior of the clusters during relaxation is studied in two-dimensional Potts model using cluster algorithm. Average cluster size and cluster formation velocity are calculated on two different lattice sizes for different number…
The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$…
We investigate the structure of 13-particle clusters in binary alloys for various size ratios and different concentrations via MD simulation. Our goal is to predict which systems are likely to form local icosahedral structures when rapidly…
We study the scaling of the average cluster size and percolation strength of geometrical clusters for the two-dimensional Ising model. By means of Monte Carlo simulations and a finite-size scaling analysis we discuss the appearance of…
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…
Unlike atoms, colloidal particles are not identical, but can only be synthesised within a finite size tolerance. Colloids are therefore polydisperse, i.e. mixtures of infinitely many components with sizes drawn from a continuous…
Given a weighted and complete graph G = (V, E), V denotes the set of n objects to be clustered, and the weight d(u, v) associated with an edge (u, v) belonging to E denotes the dissimilarity between objects u and v. The diameter of a…
Low-dimensional free-standing aggregates of bare gold clusters are studied by the molecular dynamics simulation. Icosahedra of 55 and 147 atoms are equilibrated at T=300 K. Then, their one- and two-dimensional assemblies are investigated.…
This contribution is concerned with the effective viscosity problem, that is, the homogenization of the steady Stokes system with a random array of rigid particles, for which the main difficulty is the treatment of close particles. Standard…
High-density (HD) percolation describes the percolation over specific $\kappa$ -clusters, which are the compact sets of sites each connected to $\kappa$ nearest filled sites at least. It takes place in the classical patterns of…
This paper presents a novel geometrical approach to investigate the convexity of a density-based cluster. Our approach is grid-based and we are about to calibrate the value space of the cluster. However, the cluster objects are coming from…
Series of experiments on turbulent bubbly channel flows observed bubble clusters near the wall which can change large-scale flow structures. To gain insights into clustering mechanisms, we study the interaction of a pair of spherical…
The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad theoretical worst-cases. Prime examples are least-squares…
Granular packings of non-convex or elongated particles can form free-standing structures like walls or arches. For some particle shapes, such as staples, the rigidity arises from interlocking of pairs of particles, but the origins of…