Related papers: Construction of local structure maps for cellular …
Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda…
Computing the probability of evidence even with known error bounds is NP-hard. In this paper we address this hard problem by settling on an easier problem. We propose an approximation which provides high confidence lower bounds on…
Let M be a monoid (e.g. the lattice Z^D), and A an abelian group. A^M is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. Let mu be a (possibly…
Cryptographic schemes using one-dimensional, three-neighbor cellular automata as a primitive have been put forth since at least 1985. Early results showed good statistical pseudorandomness, and the simplicity of their construction made them…
Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
We consider one dimensional block cellular automata, where the local update rules are given by Yang-Baxter maps, which are set theoretical solutions of the Yang-Baxter equations. We show that such systems are superintegrable: they possess…
Consider the problem of approximating a given probability distribution on the cube $[0,1]^n$ via the use of a square lattice discretization with mesh-size $1/N$ and the Metropolis algorithm. Here the dimension $n$ is fixed and we focus for…
We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects…
We propose an interacting many-body space-time-discrete Markov chain model, which is composed of an integrable deterministic and reversible cellular automaton (the rule 54 of [Bobenko et al, CMP 158, 127 (1993)]) on a finite one-dimensional…
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
Motivated by recent investigations of Sophie Grivaux and \'Etienne Matheron on the existence of invariant measures in Linear Dynamics, we introduce the concept of locally bounded orbit for a continuous linear operator $T:X\longrightarrow X$…
In this paper we study the liftability property for piecewise continuous maps of compact metric spaces, which admit inducing schemes in the sense of Pesin and Senti [PS05, PS06]. We show that under some natural assumptions on the inducing…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
Learning the undirected graph structure of a Markov network from data is a problem that has received a lot of attention during the last few decades. As a result of the general applicability of the model class, a myriad of methods have been…
Hybrid systems whose mode dynamics are governed by non-linear ordinary differential equations (ODEs) are often a natural model for biological processes. However such models are difficult to analyze. To address this, we develop a…
This paper investigates the $k$-mixing property of a multidimensional cellular automaton. Suppose $F$ is a cellular automaton with the local rule $f$ defined on a $d$-dimensional convex hull $\mathcal{C}$ which is generated by an apex set…
Let $(\az,F)$ be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the $\N\times\Z$-action of $F$ and the shift map $\s$ to be the Haar measure on $\gs$, a closed…
Stochastic parameterisations deployed in models of the Earth system frequently invoke locality assumptions such as Markovianity or spatial locality. This work highlights the impact of such assumptions on predictive performance. Both in…