The kirkwood-salsburg equations for random continuum percolation

We develop two different hierarchies of Kirkwood-Salsburg equations for the connectedness functions of random continuum percolation. These equations are derived by writing the Kirkwood-Salsburg equations for the distribution functions of thes-state continuum Potts model (CPM), taking thes1 limit, and forming appropriate linear combinations. The first hierarchy is satisfied by a subset of the connectedness functions used in previous studies. It gives rigorous, low-order bounds for the mean number of clusters n _c and the two-point connectedness function. The second hierarchy is a closed set of equations satisfied by the generalized blocking functions, each of which is defined by the probability that a given set of connections between particles is absent. These auxiliary functions are shown to be a natural basis for calculating the properties of continuum percolation models. They are the objects naturally occurring in integral equations for percolation theory. Also, the standard connectedness functions can be written as linear combinations of them. Using our second Kirkwood-Salsburg hierarchy, we show the existence of an infinite sequence of rigorous, upper and lower bounds for all the quantities describing random percolation, including the mean cluster size and mean number of clusters. These equations also provide a rigorous lower bound for the radius of convergence of the virial series for the mean number of clusters. Most of the results obtained here can be readily extended to percolation models on lattices, and to models with positive (repulsive) pair potentials.     

Percolation of the Loss of Tension in an Infinite Triangular Lattice

We introduce a new class of bootstrap percolation models where the local rules are of a geometric nature as opposed to simple counts of standard bootstrap percolation. Our geometric bootstrap percolation comes from rigidity theory and convex geometry. We outline two percolation models: a Poisson model and a lattice model. Our Poisson model describes how defects--holes is one of the possible interpretations of these defects--imposed on a tensed membrane result in a redistribution or loss of tension in this membrane; the lattice model is motivated by applications of Hooke spring networks to problems in material sciences. An analysis of the Poisson model is given by Menshikov et al. ⁽⁴⁾ In the discrete set-up we consider regular and generic triangular lattices on the plane where each bond is removed with probability 1–p. The problem of the existence of tension on such lattice is solved by reducing it to a bootstrap percolation model where the set of local rules follows from the geometry of stresses. We show that both regular and perturbed lattices cannot support tension for any p<1. Moreover, the complete relaxation of tension--as defined in Section 4--occurs in a finite time almost surely. Furthermore, we underline striking similarities in the properties of the Poisson and lattice models.     

Topology invariance in percolation thresholds

An universal invariant for site and bond percolation thresholds ( and respectively) is proposed. The invariant writes where and are positive constants, and d the space dimension. It is independent of the coordination number, thus exhibiting a topology invariance at any d. The formula is checked against a large class of percolation problems, including percolation in non-Bravais lattices and in aperiodic lattices as well as rigid percolation. The invariant is satisfied within a relative error of for all the twenty lattices of our sample at d=2, d=3, plus all hypercubes up to d=6. Received: 7 July 1997 / Accepted: 5 November 1997     

Bond percolation with parallelism restriction on square lattices

As a simple approximation for the ±J spin glass we studied bond percolation on square lattices. However, two neighboring chains of ferromagnetic bonds are required for spins to be regarded as connected. We determine the percolation thresholdp _c =0.8282±0.0002 and the critical exponent =0.75 _–0.05 ^+0.02 for this specific percolation by means of Monte-Carlo simulation on square lattices (up to 150×150).     

Extension of the Arrowsmith–Essam Formula to the Domany–Kinzel Model

Arrowsmith and Essam gave an expansion formula for point-to-point connectedness functions of the mixed site-bond percolation model on oriented lattices, in which each term is characterized by a graph. We extend this formula to general k-point correlation functions, which are point-to-set (with k points) connectivities in the context of percolation, of the two-neighbor discrete-time Markov process (stochastic cellular automata with two parameters) in one dimension called the Domany–Kinzel model, which includes the mixed site-bond oriented percolation model on a square lattice as a special case. Our proof of the formula is elementary and based on induction with respect to time-step, which is different from the original graph-theoretical one given by Arrowsmith and Essam. We introduce a system of m interacting random walkers called m friendly walkers (m FW) with two parameters. Following the argument of Cardy and Colaiori, it is shown that our formula is useful to derive a theorem that the correlation functions of the Domany–Kinzel model are obtained as an m0 limit of the generating functions of the m FW.     

Breakdown of universality in directed spiral percolation

Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is studied on the triangular lattice in two dimensions (2D). The results are compared with that of the 2D square lattice. Clusters generated in this model are generally rarefied and have chiral dangling ends on both the square and triangular lattices. It is found that the clusters are more compact and less anisotropic on the triangular lattice than on the square lattice. The elongation of the clusters is in a different direction than the imposed directional constraint on both the lattices. The values of some of the critical exponents and fractal dimension are found considerably different on the two lattices. The DSP model then exhibits a breakdown of universality in 2D between the square and triangular lattices. The values of the critical exponents obtained for the triangular lattice are not only different from that of the square lattice but also different form other percolation models.Received: 12 March 2004, Published online: 23 July 2004PACS: 02.50.-r Probability theory, stochastic processes, and statistics - 64.60.-i General studies of phase transitions - 72.80.Tm Composite materials     

Time-dependent correlation functions for random walks on bond disordered cubic lattices

For hopping models on cubic lattices with a fractionc of impurity bonds, time-dependent transport properties and correlation functions (long-time tails) are calculated through a systematicc-expansion (in the percolation literature referred to as high-density expansion), using a method developed in an earlier paper. The time-dependent diffusion coefficient, velocity autocorrelation function (VACF), and Burnett functions are calculated exact toO(c) for allt, and exact toO(c ₂ ) for long times only. A comparison is made with the results of the effective medium approximation, and numerical results are given for the square lattice.     

Density and uniqueness in percolation

Two results on site percolation on thed-dimensional lattice,d1 arbitrary, are presented. In the first theorem, we show that for stationary underlying probability measures, each infinite cluster has a well-defined density with probability one. The second theorem states that if in addition, the probability measure satisfies the finite energy condition of Newman and Schulman, then there can be at most one infinite cluster with probability one. The simple arguments extend to a broad class of finite-dimensional models, including bond percolation and regular lattices.     

Critical behavior in a model of correlated percolation

We study the critical behavior of certain two-parameter families of correlated percolation models related to the Ising model on the triangular and square lattices, respectively. These percolation models can be considered as interpolating between the percolation model given by the + and – clusters and the Fortuin-Kasteleyn correlated percolation model associated to the Ising model. We find numerically on both lattices a two-dimensional critical region in which the expected cluster size diverges, yet there is no percolation.     

Long-time effect of relaxation for hyperbolic conservation laws

In processes such as invasion percolation and certain models of continuum percolation, in which a possibly random labelf(b) is attached to each bondb of a possibly random graph, percolation models for various values of a parameterr are naturally coupled: one can define a bondb to be occupied at levelr iff(b)r. If the labeled graph is stationary, then under the mild additional assumption of positive finite energy, a result of Gandolfi, Keane, and Newman ensures that, in lattice models, for each fixedr at which percolation occurs, the infinite cluster is unique a.s. Analogous results exist for certain continuum models. A unifying framework is given for such fixed-r results, and it is shown that if the site density is finite and the labeled graph has positive finite energy, then with probability one, uniqueness holds simultaneously for all values ofr. An example is given to show that when the site density is infinite, positive finite energy does not ensure uniqueness, even for fixedr. In addition, with finite site density but without positive finite energy, one can have fixed-r uniqueness a.s. for eachr, yet not have simultaneous uniqueness.Research supported by NSF grant DMS-9206139     

Percolation on infinitely ramified fractals

We present a family of exact fractals with a wide range of fractal and fracton dimensionalities. This includes the case of the fracton dimensionality of 2, which is critical for diffusion. This is achieved by adjusting the scaling factor as well as an internal geometrical parameter of the fractal. These fractals include the cases of finite and infinite ramification characterized by a ramification exponentp. The infinite ramification makes the problem of percolation on these lattices a nontrivial one. We give numerical evidence for a percolation transition on these fractals. This transition is tudied by a real-space renormalization group technique on lattices with fractal dimensionality ¯d between 1 and 2. The critical exponents for percolation depend strongly on the geometry of the fractals.     

Similarity of Percolation Thresholds on the HCP and FCC Lattices

Extensive Monte Carlo simulations were performed in order to determine the precise values of the critical thresholds for site (p ^hcp _{c, S} =0.199 255 5±0.000 001 0) and bond (p ^hcp _{c, B} =0.120 164 0±0.000 001 0) percolation on the hcp lattice to compare with previous precise measurements on the fcc lattice. Also, exact enumeration of the hcp and fcc lattices was performed and yielded generating functions and series for the zeroth, first, and second moments of both lattices. When these series and the values of p _c are compared to those for the fcc lattice, it is apparent that the site percolation thresholds are different; however, the bond percolation thresholds are equal within error bars, and the series only differ slightly in the higher order terms, suggesting the actual values are very close to each other, if not identical.     

Hypergeometric series in a series expansion of the directed-bond percolation probability on the square lattice

The asymmetric directed-bond percolation (ADBP) problem with an asymmetry parameterk is introduced and some rigorous results are given concerning a series expansion of the percolation probability on the square lattice. It is shown that the first correction term,d _n,1 (k) is expressed by Gauss' hypergeometric series with a variablek. Since the ADBP includes the ordinary directed bond percolation as a special case withk=1, our results give another proof for the Baxter-Guttmann's conjecture thatd _n,1(1) is given by the Catalan number, which was recently proved by Bousquet-Mélou. Direct calculations on finite lattices are performed and combining them with the present results determines the first 14 terms of the series expansion for percolation probability of the ADBP on the square lattice. The analysis byDlog Padé approximations suggests that the critical value depends onk, while asymmetry does not change the critical exponent of percolation probability.     

Percolation and cluster distribution. II. layers,variable-range interactions,and exciton cluster model

Monte Carlo simulations for the site percolation problem are presented for lattices up to 64 x 10⁶ sites. We investigate for the square lattice the variable-range percolation problem, where distinct trends with bond-length are found for the critical concentrations and for the critical exponents and. We also investigate the layer problem for stacks of square lattices added to approach a simple cubic lattice, yielding critical concentrations as a functional of layer number as well as the correlation length exponent. We also show that the exciton migration probability for a common type of ternary lattice system can be described by a cluster model and actually provides a cluster generating function.Supported by NSF Grant DMR76-07832.     

A new universality for random sequential deposition of needles

Percolation and jamming phenomena are investigated for random sequential deposition of rectangular needles on d=2 square lattices. Associated thresholds and are determined for various needle sizes. Their ratios are found to be a constant for all sizes. In addition the ratio of jamming thresholds for respectively square blocks and needles is also found to be a constant . These constants exhibit some universal connexion in the geometry of jamming and percolation for both anisotropic shapes (needles versus square lattices) and isotropic shapes (square blocks on square lattices). A universal empirical law is proposed for all three thresholds as a function of a. Received 27 January 2000 and Received in final form 2 February 2000     

Ising model on self-avoiding walk chains

The phase transitions of nearest-neighbour interacting Ising models on self-avoiding walk (SAW) chains on square and triangular lattices have been studied using Monte Carlo technique. To estimate the transition temperature (T _c) bounds, the average number of nearest-neighbours (Z _eff) of spins on SAWs have been determined using the computer simulation results, and the percolation thresholds (p _c) for site dilution on SAWs have been determined using Monte Carlo methods. We find, for SAWs on square and triangular lattices respectively,Z _eff=2.330 and 3.005 (which compare very well with our previous theoretically estimated values) andp _c=0.022±0.003 and 0.045±0.005. When put in Bethe-Peierls approximations, the above values ofZ _eff givekT _c/J<1.06 and 1.65 for Ising models on SAWs on square and triangular lattices respectively, while, using the semi-empirical relation connecting the Ising modelT _c's andp _c's for the same lattices, we findkT _c/J0.57 and 0.78 for the respective models. Using the computer simulation results for the shortest connecting path lengths in SAWs on both kinds of lattices, and integrating the spin correlations on them, we find the susceptibility exponent =1.024±0.007, for the model on SAWs on two dimensional lattices.     

Simultaneous analysis of three-dimensional percolation models

We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, 2013, 87（5）： 052107], it is observed that in comparison with dimensionless ratios based on cluster-size distribution, certain wrapping probabilities exhibit weaker finite-size corrections and are more sensitive to the deviation from percolation threshold Pc, and thus provide a powerful means for determining Pc. We analyze the numerical data of the wrapping probabilities simultaneously such that universal parameters are shared by the aforementioned models, and thus significantly improved estimates of Pc are obtained.     

Monte Carlo evidence for the deviation from the Alexander-Orbach rule in three-dimensional percolation

Computer simulation is used to study the diffusion at the percolation threshold on large simple cubic lattices. The exponentk for the rms displacementr witht inr t_k is found to be smaller than 0.2, while the Alexander-Orbach 4/3 rule for the spectral dimension predictsk=0.201 ± 0.002.on leave from Minnesota Supercomputer Institute and School of Physics and Astronomy, University of Minnesota, Minneapolis, Minnesota 55455.     

An alternative proof of some percolation threshold (p c ) using the idea of self-organized criticality

Summary By means of a well-developed method in self-organized criticality, we can obtain the lower bound for the percolation threshold (p _c) of the corresponding site percolation problem. In some special cases, we have proved that such lower bounds are indeed the percolation thresholds. We can reproduce some well-known percolation thresholds of various lattices including the Cayley trees and Kock curves in this framework.     

On stochastic spatial patterns and neuronal polarity

To investigate the statistical behavior in the sizes of finite clusters for percolation, cluster size distribution n _s (p) for site and bond percolations at different lattices and dimensions was simulated using a modified algorithm. An equation to approximate the finite cluster size distribution n _s (p) was obtained and expressed as: log?(n _s (p)) = as ? b log?s + c. Based on the analysis of simulation data, we found that the equation is valid for p from 0 to 1 on site and for the bond percolation of two-dimensional (2D) and three-dimensional (3D) lattices. Furthermore, the relationship between the coefficients of the equation and the occupied ratio p was studied using the finite-size scaling method. When \(x = D(p - p_c )L^{y_t }\) , p < p _c , and D was a nonuniversal metric factor. a was found to be related only to p, and the a-x curves of different lattices were nearly overlapped; b was related to the dimensions and p, and the scaled data of the b of all lattices with the same dimension tended to fall on the same curves. Unlike a and b, c apparently had a quadratic relation with x in 2D lattices and linear relation with x in 3D lattices. The results of this paper could significantly reduce the amount of tasks required to obtain numerical data of on the cluster size distribution for p from 0 to p _c .