论文信息 - Simulation of a cellular automat with an oriented bootstrap rule

Simulation of a cellular automat with an oriented bootstrap rule

The evolution of a cellular automat with a culling or bootstrap condition on the minimum number of neighbours for survival has been simulated. The introduction of an orientational constraint converts the lattice from isotropic to semidirected. Simulations of systems of up to 230 million sites are found to be compatible with a threshold value of p=0.966±0.01.

J.A.M.S. Duarte

[1] A. Enter. Proof of Straley's argument for bootstrap percolation , 1987 .

[2] Joan Adler,et al. Diffusion percolation. I. Infinite time limit and bootstrap percolation , 1988 .

[3] D. Stauffer,et al. Periods and clusters in Ising cellular automata , 1987 .

[4] J. Nadal,et al. On the spreading dimension of percolation and directed percolation clusters , 1984 .

[5] P. Leath,et al. Bootstrap percolation on a Bethe lattice , 1979 .

[6] A. Szpilka. The asymptotic behaviour of directed self-avoiding walks , 1983 .

[7] Michael Aizenman,et al. Metastability effects in bootstrap percolation , 1988 .

[8] R. Lenormand. Pattern growth and fluid displacements through porous media , 1986 .

[9] D. Stauffer. Classification of square lattice cellular automata , 1989 .

[10] D. Stauffer,et al. Comparison of bootstrap percolation models , 1989 .

[11] P. Leath,et al. Bootstrap percolation transitions on real lattices , 1981 .