Related papers: Effective symbolic dynamics, random points, statis…
The notion of effective topological complexity, introduced by B{\l}aszczyk and Kaluba, deals with using group actions in the configuration space in order to reduce the complexity of the motion planning algorithm. In this article we focus on…
We consider non-i.i.d. random holomorphic dynamical systems whose choice of maps depends on Markovian rules. We show that generically, such a system is mean stable or chaotic with full Julia set. If a system is mean stable, then the…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
Using Caratheodory measures, we associate to each positive orbit ${\mathcal O}_{f}^{+}(x)$ of a measurable map $f$, a Borel measure $\eta_{x}$. We show that $\eta_{x}$ is $f$-invariant whenever $f$ is continuous or $\eta_{x}$ is a…
A central concept in the connection between physics and information theory is entropy, which represents the amount of information extracted from the system by the observer performing measurements in an experiment. Indeed, Jaynes' principle…
The Birkhoff Ergodic Theorem asserts under mild conditions that Birkhoff averages (i.e. time averages computed along a trajectory) converge to the space average. For sufficiently smooth systems, our small modification of numerical Birkhoff…
In this document, we aim to gather various results related to a compositional/categorical approach to rigorous Statistical Mechanics. Rigorous Statistical Mechanics is centered on the mathematical study of statistical systems. Central…
In dynamical systems composed of interacting parts, conditional exponents, conditional exponent entropies and cylindrical entropies are shown to be well defined ergodic invariants which characterize the dynamical selforganization and…
Large entropy fluctuations in an equilibrium steady state of classical mechanics were studied in extensive numerical experiments on a simple 2--freedom strongly chaotic Hamiltonian model described by the modified Arnold cat map. The rise…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
A practical and popular technique to extract the symbolic dynamics from experimentally measured chaotic time series is the threshold-crossing method, by which an arbitrary partition is utilized for determining the symbols. We address to…
The relationships between port-Hamiltonian systems modeling and the notion of monotonicity are explored. The earlier introduced notion of incrementally port-Hamiltonian systems is extended to maximal cyclically monotone relations, together…
Since its origin in the thermodynamics of the 19th century, the concept of entropy has also permeated other fields of physics and mathematics, such as Classical and Quantum Statistical Mechanics, Information Theory, Probability Theory,…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…
We determine limiting equations for large asymmetric `spin glass' networks. The initial conditions are not assumed to be independent of the disordered connectivity: one of the main motivations for this is that allows one to understand how…
We investigate the statistical equilibrium properties of a system of classical particles interacting via Newtonian gravity, enclosed in a three-dimensional spherical volume. Within a mean-field approximation, we derive an equation for the…
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…
Dynamical systems and physical models defined on idealized continuous phase spaces are known to exhibit non-computable phenomena, examples include the wave equation, recurrent neural networks, or Julia sets in holomorphic dynamics. Inspired…
This paper is aim to extend Kenneth R. Berg's findings on the maximal entropy theorem and the ergodicity of measure convolution to the case of surjective homomorphisms. We further explores dynamical systems under surjective homomorphism in…
In this paper we investigate a quantity called conditional entropy of ordinal patterns, akin to the permutation entropy. The conditional entropy of ordinal patterns describes the average diversity of the ordinal patterns succeeding a given…