相关论文: Random growth models with polygonal shapes

The spatial structure, fluctuations as well as all state probabilities of self-organized (steady) states of cellular automata can be found (almost) exactly and {\em explicitly} from their Markovian dynamics. The method is shown on an…

In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…

Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more…

A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…

A new sufficient condition is proved for the existence of stochastic semigroups generated by the sum of two unbounded operators. It is applied to one-dimensional piecewise deterministic Markov processes, where we also discuss the existence…

In this thesis we will work under the premises of the Cellular Automata Interpretation of QM, by Gerard 't Hooft, according to whom particles evolve following the rules of Cellular Automata (CA), a mathematical model consisting of discrete…

Regulation of cell proliferation is a crucial aspect of tissue development and homeostasis and plays a major role in morphogenesis, wound healing, and tumor invasion. A phenomenon of such regulation is contact inhibition, which describes…

We present a probabilistic 3D generative model, named Generative Cellular Automata, which is able to produce diverse and high quality shapes. We formulate the shape generation process as sampling from the transition kernel of a Markov…

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…

The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…

Many growth processes lead to intriguing stochastic patterns and complex fractal structures which exhibit local scale invariance properties. Such structures can often be described effectively by space-time trajectories of interacting…

The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…

We propose some conjectures for asymptotic distribution of probabilistic Burgers cellular automaton (PBCA) which is defined by a simple motion rule of particles including a probabilistic parameter. Asymptotic distribution of configurations…

Let $\{X_i\}_{i=1}^{\infty}$ be a sequence of independent copies of a random vector $X$ in $\mathbb{R}^n$. We revisit the question to determine the asymptotic shape of the random polytope $K_N={\rm conv}\{X_1,\ldots ,X_N\}$ where $N>n$. We…

We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…

We study the convolution of functions of the form \[ f_\alpha (z) := \dfrac{\left( \frac{1 + z}{1 - z} \right)^\alpha - 1}{2 \alpha}, \] which map the open unit disk of the complex plane onto polygons of 2 edges when $\alpha\in(0,1)$. We…

Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…

We study two global structural properties of a graph $\Gamma$, denoted AS and CFS, which arise in a natural way from geometric group theory. We study these properties in the Erd\"os--R\'enyi random graph model G(n,p), proving a sharp…

Some deterministic cellular automata have been observed to follow the pattern of the second law of thermodynamics: starting from a partially disordered state, the system evolves towards a state of equilibrium characterized by maximal…

Self-organizing complex systems can be modeled using cellular automaton models. However, the parametrization of these models is crucial and significantly determines the resulting structural pattern. In this research, we introduce and…