Related papers: An analytical formulation for roughness based on c…
Surface roughness influences turbulent boundary layers (TBLs) primarily through the roughness function $\Delta U^+$ and the equivalent sand-grain roughness height \(k_s\). Direct determination of \(k_s\) typically requires detailed velocity…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
Cells exert traction forces on compliant substrates and can induce surface instabilities that appear as characteristic wrinkling patterns. Here, we develop a mechanical description of cell-induced wrinkling on soft substrates using a thin…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
Functional data analysis is concerned with the analysis of infinite-dimensional data functions. Functional principal component analysis (FPCA) is a key method to obtain finite-dimensional summaries. Consistency of FPCA has been…
We define the notion of stochastic stability, already present in the literature in the context of smooth dynamical systems, for invariant measures of cellular automata perturbed by a random noise, and the notion of strongly stochastically…
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
The Cellular Automaton (CA) modeling and simulation of solid dynamics is a long-standing difficult problem. In this paper we present a new two-dimensional CA model for solid dynamics. In this model the solid body is represented by a set of…
The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
We show that the roughness exponent zeta of an in-plane crack front slowly propagating along a heterogeneous interface embeded in a elastic body, is in full agreement with a correlated percolation problem in a linear gradient. We obtain…
It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular…
Agent-based (AB) or Cellular Automata (CA) models are rule based and are a relatively simple discrete method that can be used to simulate complex interactions of many agents or cells. The relative ease of implementing the computational…
Analytical contact mechanics theories depend on surface roughness through the surface roughness power spectrum. In the present study, we evaluated the usability of various experimental methods for studying surface roughness. Our findings…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…
We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is interpreted in terms of biological systems, and biologically…
We study, both with numerical simulations and theoretical methods, a cellular automata model for continuum equations describing growth processes in the presence of an external flux of particles. As a result of local instabilities we find a…
Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occur at different times. This gives greater flexibility to…