Related papers: Cellular automata, percolation and dynamical dicho…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…
We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…
We introduce a general framework to show the indistinguishability of infinite clusters (ergodicity of the cluster subrelation) in group-invariant percolation processes with a weaker version of the finite energy property: the possibility of…
Dynamic properties of a one-dimensional probabilistic cellular automaton are studied by monte-carlo simulation near a critical point which marks a second-order phase transition from a active state to a effectively unique absorbing state.…
Revisiting the notion of m-almost equicontinuous cellular automata introduced by R. Gilman, we show that the sequence of image measures of a shift ergodic measure m by iterations of a m-almost equicontinuous automata F, converges in Cesaro…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
Given a group $\Gamma$, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of $\Gamma$ for increasingly large…
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads. We explore the viability and value of similar modeling…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
We consider the discrete Boolean model of percolation on graphs satisfying a doubling metric condition. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
If $G$ is a finitely generated group and $X$ is a Cayley graph of $G$, denote by $\mathcal{C}_1^X(G)$ the subgroup of all automorphisms of $X$ commensurating $G$ and fixing the vertex corresponding to the identity. Building on the work of…
We find evidence for a continuum limit of a particular causal set dynamics which depends on only a single ``coupling constant'' $p$ and is easy to simulate on a computer. The model in question is a stochastic process that can also be…
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…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
Cornerstones of the Cellular Automaton Interpretation of Quantum Mechanics are its ontological states that evolve by permutations, in this way never creating would-be quantum mechanical superposition states. We review and illustrate this…
On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…