,

Conditional Deposition of Particles on a Surface – a Fractal versus Non-fractal Dimension of the Percolating Clusters

, и .
Abstract Book of the XXIII IUPAP International Conference on Statistical Physics, Genova, Italy, (9-13 July 2007)

Аннотация

The formation of a real surface is influenced by a large number of factors and it is almost impossible to distinguish all of them. The hope is, however, that there is a small number of basic 'laws' determining the morphology and the dynamics of the growth. The action of these basic laws can be described in microscopic detail through discrete growth models that mimic essential physics bypassing some of the less important details. We propose a parametric model for studying the non-equilibrium interfaces: particles, deposited on a surface, stick conditionally with a probability $ømega(łambda)$, where $łambda$ is a controlling parameter; $= 0$ corresponds to a 2D percolation on a square lattice 1. We start with an empty surface, chose a site $i$ at random, and release a particle. The particle is seeded in $i$ with a probability $ømega(łambda)$ which is: (a) $= 1$, if either all neighbors are empty, or only one site is occupied; (b) $= 1/łambda$ if two opposite neighbors are occupied; (c) $ømega=1/łambda^2$ if three neighbors are occupied. The parameter $łambda$ could take any positive real value. Here we present results for $=2, 2, 3, 4$. Unlike the known Alexandrowitz's algorithm where the sites visited previously are marked and excluded from the further trials, our model counts all the empty sites in every trial. The deposition of particles continues until a concentration $c $ 0,1 is reached. The concentration is defined as the ratio of N (number of particles) and LxL (number of cells). The time for deposition of N particles is scaled by the number of trial steps, e.g. it depends on $ømega(łambda)$ and increases with the concentration. This is a simulation of a hampered aggregation of non-diffusive particles. For some critical particle concentrations $p_c(łambda)$, the connecting clusters are fractals. A technique, which is a modification of the box-counting method (Parrinello), has been worked out for determining the fractal dimension. An object-oriented code (C++) has been developed for the Monte Carlo part of the calculations. This style of coding allows an abstract definition of the ‘nearest neighbors’ and by changing the number of neighbors one can solve 2D, 3D or higher-dimensional problems implementing the same code. Other applications can be simulated with our model: a transition from an insulating surface to a metallic one, if the particles are metal atoms or a change of the social communications influenced by mass media 2.\ References: 1 Stauffer D and Aharony A 1991 Introduction to Percolation Theory 2nd edn. (London: Taylor and Francis). 2 Proykova A and Stauffer D, Physica A, vol 312/1-2 pp 300-304, (2002).

тэги

Пользователи данного ресурса

  • @statphys23

Комментарии и рецензии