Critical points of two-dimensional bootstrap percolation-like cellular automata

1990 ◽  
Vol 58 (5-6) ◽  
pp. 1239-1244 ◽  
Author(s):  
Roberto H. Schonmann
1993 ◽  
Vol 03 (02) ◽  
pp. 293-321 ◽  
Author(s):  
JÜRGEN WEITKÄMPER

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.


1985 ◽  
Vol 32 (7) ◽  
pp. 4760-4762 ◽  
Author(s):  
Jeffrey J. Hamilton

2017 ◽  
Vol 28 (08) ◽  
pp. 1750099
Author(s):  
F. W. S. Lima

We investigate the critical properties of the equilibrium and nonequilibrium two-dimensional (2D) systems on Solomon networks with both nearest and random neighbors. The equilibrium and nonequilibrium 2D systems studied here by Monte Carlo simulations are the Ising and Majority-vote 2D models, respectively. We calculate the critical points as well as the critical exponent ratios [Formula: see text], [Formula: see text], and [Formula: see text]. We find that numerically both systems present the same exponents on Solomon networks (2D) and are of different universality class than the regular 2D ferromagnetic model. Our results are in agreement with the Grinstein criterion for models with up and down symmetry on regular lattices.


2020 ◽  
Vol 8 (6) ◽  
pp. 5741-5748

This paper proposes a hybrid programmable two-dimensional Cellular Automata (CA) based pseudo-random number generator which includes a newly designed rule set. The properties and evolution of one and two dimensional CA are revisited. The various metrics for evaluating CA as a Pseudo-Random Number Generator (PRNG) are discussed. It is proved that the randomness is high irrespective of the initial seed by applying this newly designed rule set. The PRNG is tested against a popular statistical test called Diehard test suite and the results show that the PRNG is highly random. The chaotic measures like entropy, hamming distance and cycle length have been measured


Sign in / Sign up

Export Citation Format

Share Document