Clustering properties of d-dimensional overlapping spheres.
Clustering properties of d-dimensional overlapping spheres.
复制标题
d 维重叠球体的聚类特性。
DOI:
--
复制
发表时间:
1996
期刊:
影响因子:
--
通讯作者:
S. Torquato
中科院分区:
文献类型:
--
作者:
J. Quintanilla;S. Torquato
A prototypical model of continuum percolation is a system of spatially uncorrelated, equal-sized spheres in one, two, and three dimensions @1‐14#. In this model, spheres of equal size are centered on the points of a stationary Poisson process. Since the spheres are allowed to overlap, clusters of various sizes and volumes are formed, as depicted in Fig. 1. This model has been given a variety of names, including ‘‘fully penetrable spheres,’’ ‘‘randomly overlapping spheres,’’ the ‘‘Swiss-cheese model,’’ and the ‘‘Poisson blob model.’’ We shall henceforth refer to this model as overlapping spheres. Certain types of ‘‘connectedness’’ functions and related quantities have been analytically and numerically determined for this model @3‐12,15,16#. In this paper we present integral representations of the average number density nk of a k-mer ~a cluster comprised of k spheres! and the average volume v k of a k-mer for overlapping spheres in d dimensions. The nk have been used to estimate the percolation threshold and critical exponent of various overlapping particle systems @1#, rigorously bound the mean cluster density @11#, and study surface tension in percolation models @17#. We use a constructive paradigm to efficiently evaluate these integral expressions for nk and v k . To illustrate this paradigm, we derive exact analytical results for the quantities pk and v k in one dimension. In higher dimensions, however, these quantities are integrals that cannot be evaluated analytically and we have to settle for numerical evaluation. We find that the constructive paradigm yields integrals free of the redundancies inherent in previous work @16# and so these integrals can be numerically evaluated more efficiently. The effort to perform these numerical integrations increases as k and the number of dimensions increase, and therefore efficient computation of these integrals becomes imperative. With this approach, we are able to compute n4 and correctly evaluate v 2, v 3, and v 4 for any sphere number density r. Our evaluations of these quantities are in excellent agreement with Monte Carlo simulations that we also perform. We also will study various cluster statistics related to the average number of particles and average volume of the clusters within the system. We will consider Q, the average number of particles contained in a cluster chosen at random, S, the average number of particles in the cluster of a particle chosen at random, VQ , the average volume of a randomly chosen cluster, and VS , the average volume of the cluster containing a randomly chosen particle. The ‘‘particleaveraged cluster number’’ S and the ‘‘particle-averaged cluster volume’’ VS both diverge at the percolation threshold ~the minimum density at which a cluster of infinite size and volume exists @15,16#!. However, the ‘‘average cluster number’’ Q and ‘‘average cluster volume’’ VQ remain finite at the percolation threshold for spatial dimension d>2. The cluster statistic S, sometimes called the mean cluster size, is a wellknown quantity in percolation theory and has been studied