Related papers: Mixing properties in coded systems
In the class of Ornstein transformations the mixing property satisfies a 0-1 law. Here we consider Ornstein's construction with bounded cutting parameter. In fact, these latter transformations are not mixing, however it is proved that the…
We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…
The article considers systems of interacting particles on networks with adaptively coupled dynamics. Such processes appear frequently in natural processes and applications. Relying on the notion of graph convergence, we prove that for large…
We prove results on mixing and mixing rates for toral extensions of nonuniformly expanding maps with subexponential decay of correlations. Both the finite and infinite measure settings are considered. Under a Dolgopyat-type condition on…
We construct strongly mixing invariant measures with full support for operators on F-spaces which satisfy the Frequent Hypercyclicity Criterion. For unilateral backward shifts on sequence spaces, a slight modification shows that one can…
This paper deals with the topological entropy for hom Markov shifts $\mathcal{T}_M$ on $d$-tree. If $M$ is a reducible adjacency matrix with $q$ irreducible components $M_1, \cdots, M_q$, we show that $h(\mathcal{T}_{M})=\max_{1\leq i\leq…
A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…
Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…
We present an inequality that classifies mixed multipartite systems of an arbitrary dimension with respect to separability and positivity of partial transpose properties. This inequality gives a way to experimentally classify the observed…
This paper aims to review the measure synchronization, a weak form of synchronization observed in coupled Hamiltonian systems, briefly. This synchronization is characterized by a Hamiltonian system that displays either quasiperiodic or…
Symmetries are ubiquitous in network systems and have profound impacts on the observable dynamics. At the most fundamental level, many synchronization patterns are induced by underlying network symmetry, and a high degree of symmetry is…
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…
Let $\Sigma$ and $\bar\Sigma$ be finite alphabets. For topologically transitive sofic systems $ X\subset \Sigma^{\Bbb Z}$ and $\widetilde X\subset \widetilde\Sigma^{\Bbb Z}$ we give a necessary and sufficient condition for the existence of…
We investigate weak mixing for some classes of interval translation mappings. We give two distinct proofs that a typical Bruin-Troubetzkoy interval translation mapping is weakly mixing. Moreover, we show that the second approach extends to…
We consider piecewise monotone maps, we show that an ergodic measure for which the map is invertible almost everywhere can not be mixing. It follows that every ergodic measure for an interval translation mapping is not mixing. We also show…
We consider general linear non-degenerate weakly-coupled cooperative elliptic systems and study certain monotonicity properties of the generalized principal eigenvalue in $\mathbb{R}^d$ with respect to the potential. It is shown that…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
We study characterizations of ergodicity, weak mixing and strong mixing of W*-dynamical systems in terms of joinings and subsystems of such systems. Ergodic joinings and Ornstein's criterion for strong mixing are also discussed in this…
Probabilistic models based on continuous latent spaces, such as variational autoencoders, can be understood as uncountable mixture models where components depend continuously on the latent code. They have proven to be expressive tools for…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…