Related papers: Odometer Based Systems
We consider the activated random walk particle system, a model of self-organized criticality, on $\mathbb{Z}$ with i.i.d.-Bernoulli initial configuration. We show that at subcritical density, the system's odometer function, which counts the…
This paper defines and discusses the dimension notion of topological slow entropy of any subset for Z^d actions. Also, the notion of measure-theoretic slow entropy for Z^d actions is presented, which is modified from Brin and Katok [2].…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
Weighted shifts are an important concrete class of operators in linear dynamics. In particular, they are an essential tool in distinguishing variety dynamical properties. Recently, a systematic study of dynamical properties of composition…
We prove a criterion that allows to construct units in product systems of correspondences with prescribed infinitesimal characterizations. This criterion summarizes proofs of known results and new applications. It also frees the hypothesis…
This paper develops a theory of colimit sketches "with constructions" in higher category theory, formalising the input to the ubiquitous procedure of adjoining specified "constructible" colimits to a category such that specified "relation"…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
The ergodic decomposition theorem is a cornerstone result of dynamical systems and ergodic theory. It states that every invariant measure on a dynamical system is a mixture of ergodic ones. Here we formulate and prove the theorem in terms…
This paper shows how the use of Structural Operational Semantics (SOS) in the style popularized by the process-algebra community can lead to a more succinct and useful construction for building finite automata from regular expressions. Such…
We present a statistical mechanical theory of the process of annotating an object with terms selected from an ontology. The term selection process is formulated as an ideal lattice gas model, but in a highly structured inhomogeneous field.…
Motivated by non-equilibrium phenomena in nature, we study dynamical systems whose time-evolution is determined by non-stationary compositions of chaotic maps. The constituent maps are topologically transitive Anosov diffeomorphisms on a…
We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…
We study the linear dynamics of composition operators induced by measurable transformations on finite measure spaces, with particular emphasis on operators induced by odometers. Our first main result shows that, on a finite measure space,…
We introduce a subclass of Lie symmetries, called parameter-state symmetries, to analyse the local structural identifiability and observability of mechanistic models consisting of state-dependent ODEs with observed outputs. These symmetries…
We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…
A probability measure is a characteristic measure of a topological dynamical system if it is invariant to the automorphism group of the system. We show that zero entropy shifts always admit characteristic measures. We use similar techniques…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…
An idea that became unavoidable to study zero entropy symbolic dynamics is that the dynamical properties of a system induce in it a combinatorial structure. An old problem addressing this intuition is finding a structure theorem for…