相关论文: Asymptotic Randomization of Sofic Shifts by Linear…
We provide a machinery for transferring some properties of metrizable $ANR$-spaces to metrizable $LC^n$-spaces. As a result, we show that for complete metrizable spaces the properties $ALC^n$, $LC^n$ and $WLC^n$ coincide to each other. We…
For any infinite transitive sofic shift $X$ we construct a reversible cellular automaton (i.e. an automorphism of the shift $X$) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing…
If the log likelihood is approximately quadratic with constant Hessian, then the maximum likelihood estimator (MLE) is approximately normally distributed. No other assumptions are required. We do not need independent and identically…
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
We analyse the asymptotic symmetries of electromagnetism non-minimally coupled to scalar fields, with non-minimal couplings of the Fermi type that occur in extended supergravity models. Our study is carried out at spatial infinity where…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
The synchronization of two stochastically coupled one-dimensional cellular automata (CA) is analyzed. It is shown that the transition to synchronization is characterized by a dramatic increase of the statistical complexity of the patterns…
Let $C$ be a unital AH-algebra and let $A$ be a unital separable simple \CA with tracial rank zero. Suppose that $\phi_1, \phi_2: C\to A$ are two unital monomorphisms. We show that there is a continuous path of unitaries $\{u_t: t\in [0,…
We prove that every probabilistic cellular automaton with strictly positive transition probabilities that admits a stationary Bernoulli measure is exponentially ergodic. Moreover, the mixing time of any finite region in such a system is…
This paper studies the probability of error associated with the social machine learning framework, which involves an independent training phase followed by a cooperative decision-making phase over a graph. This framework addresses the…
We show that for any C^1+alpha diffeomorphism of a compact Riemannian manifold, every non-atomic, ergodic, invariant probability measure with non-zero Lyapunov exponents is approximated by uniformly hyperbolic sets in the sense that there…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
We study partially hyperbolic homoclinic classes of $C^1$-generic diffeomorphisms with a one-dimensional central bundle, so that the central Lyapunov exponent $\chi^c(\mu)$ is well defined for any ergodic measure $\mu$ supported on the…
We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This…
In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint…
A low artificial anisotropy cellular automaton (CA) model is developed for the simulation of microstructure evolution in directional solidification. The CA model's capture rule was modified by a limited neighbor solid fraction (LNSF)…
In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…
Two new test statistics are introduced to test the null hypotheses that the sampling distribution has an increasing hazard rate on a specified interval [0,a]. These statistics are empirical L_1-type distances between the isotonic estimates,…