相关论文: Linear cellular automata, asymptotic randomization…

Given a bi-invariant metric on a group, we construct a version of an asymptotic cone without using ultrafilters. The new construction, called the directional asymptotic cone, is a contractible topological group equipped with a complete…

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

In this paper, we pursue our study of asymptotic properties of families of random matrices that have a tensor structure. In previous work, the first- and second-named authors provided conditions under which tensor products of unitary random…

The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…

We will consider a family of cellular automata $\Phi: \{1,2,...,r\}^\mathbb{N}\circlearrowright$ that are not of algebraic type. Our first goal is to determine conditions that result in the identification of probabilities that are at the…

A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…

We study the critical behaviour of the 2d dodecahedron spin model and investigate the conjecture that the discrete model describes the same continuum theory as the O(3) non-linear sigma model. In particular, we found that the anisotropy of…

The discretization of the density matrix is proposed as a nonlinear positive map for systems with continuous variables. This procedure is used to calculate the entanglement between two modes through different criteria, such as Tsallis…

The Besicovitch pseudo-metric is a shift-invariant pseudo-metric on the set of infinite sequences, that enjoys interesting properties and is suitable for studying the dynamics of cellular automata. They correspond to the asymptotic behavior…

We investigate three aspects of weak* convergence of the $n$-step distributions of random walks on finite volume homogeneous spaces $G/\Gamma$ of semisimple real Lie groups. First, we look into the obvious obstruction to the upgrade from…

Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…

We show that the set of strictly temporally periodic points of cellular automata with almost equicontinuous points is dense in the topological support of the measure. This extends a result of Lena, Margara and Dennunzio about the density of…

We present a method for construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that…

We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…

We investigate cellular automata where some global quantity varies periodically or quasiperiodically with time. We find that these systems are highly predictable, and can be rather well described by a set of mean-field variables. We…

Maximum entropy models, motivated by applications in neuron science, are natural generalizations of the $\beta$-model to weighted graphs. Similar to the $\beta$-model, each vertex in maximum entropy models is assigned a potential parameter,…

The density classification task is to determine which of the symbols appearing in an array has the majority. A cellular automaton solving this task is required to converge to a uniform configuration with the majority symbol at each site. It…

We consider non-degenerate, finitely supported random walks on a free group. We show that the entropy and the linear drift vary analytically with th eprobability of constant support.

We introduce an efficient cellular automaton for the coagulation-fission process with diffusion 2A->3A, 2A->A in arbitrary dimensions. As the well-known Domany-Kinzel model, it is defined on a tilted hypercubic lattice and evolves by…

The $\mu$-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we…