Related papers: Fiber entropy and algorithmic complexity of random…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
The generic behavior of quantum systems has long been of theoretical and practical interest. Any quantum process is represented by a sequence of quantum channels. We consider general ergodic sequences of stochastic channels with arbitrary…
We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent $L$, the points of which with…
We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…
This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied…
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm \cite{FP22} works under variable external conditions and generates continuous motions of the system to…
Ergodic Optimization is the process of finding invariant probability measures that maximize the integral of a given function. It has been conjectured that "most" functions are optimized by measures supported on a periodic orbit, and it has…
Entropy rate of sequential data-streams naturally quantifies the complexity of the generative process. Thus entropy rate fluctuations could be used as a tool to recognize dynamical perturbations in signal sources, and could potentially be…
Making decisions freely presupposes that there is some indeterminacy in the environment and in the decision making engine. The former is reflected on the behavioral changes due to communicating: few changes indicate rigid environments;…
Let $(X,d,f)$ be a topological dynamical system, where $(X,d)$ is a compact metric space and $f:X\to X$ is a continuous map. We define $n$-ordered empirical measure of $x\in X$ by \begin{align*}…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
In this paper, we consider two questions about topological entropy of dynamical systems. We propose to resolve these questions by the same approach of using \'etale analogs of topological and algebraic dynamical systems. The first question…
If a macroscopic (random) classical system is put into a random state in phase space, it will of course the most likely have an almost maximal entropy according to second law of thermodynamics. We will show, however, the following theorem:…
The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been…
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…
Periodic orbit theory allows calculations of long time properties of chaotic systems from traces, dynamical zeta functions and spectral determinants of deterministic evolution operators, which are in turn evaluated in terms of periodic…
By establishing Multiplicative Ergodic Theorem for commutative transformations on a separable infinite dimensional Hilbert space, in this paper, we investigate Pesin's entropy formula and SRB measures of a finitely generated random…
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…
Let $(X,\mathcal{B},P)$ be a probability space and $\mathit{a}$ be a sub $\sigma$-field that is generated by an increasing sequence of sub $\sigma$-fields $(\mathit{a}_{n})_{n \in \mathbb{N}}$. Given $\theta \in \Theta$, where $\Theta$ is…