Related papers: Fiber entropy and algorithmic complexity of random…
We give an algorithm, based on the $\phi$-expansion of Parry, in order to compute the topological entropy of a class of shift spaces. The idea is the solve an inverse problem for the dynamical systems $\beta x+\alpha \mod1$.The first part…
The dynamical properties and mechanical functions of amorphous materials are governed by their microscopic structures, particularly the elasticity of the interaction networks, which is generally complicated by structural heterogeneity. This…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…
We propose a new way to measure the balance between freedom and coherence in a dynamical system and a new measure of its internal variability. Based on the concept of entropy and ideas from neuroscience and information theory, we define…
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…
In this article, we consider the weighted ergodic optimization problem of a class of dynamical systems $T:X\to X$ where $X$ is a compact metric space and $T$ is Lipschitz continuous. We show that once $T:X\to X$ satisfies both the {\em…
Topological entropy measures the number of distinguishable orbits in a dynamical system, thereby quantifying the complexity of chaotic dynamics. One approach to computing topological entropy in a two-dimensional space is to analyze the…
We study the growth of entanglement and circuit complexity in random passive linear optical networks as a function of the circuit depth. For entanglement dynamics, we start with an initial Gaussian state with all $n$ modes squeezed. For…
In the simplest sequential decision problem for an ergodic stochastic process X, at each time n a decision u_n is made as a function of past observations X_0,...,X_{n-1}, and a loss l(u_n,X_n) is incurred. In this setting, it is known that…
We study polynomial random dynamical systems with complete connections on the Riemann sphere. In this framework, the choice of the next polynomial map is governed by a state-dependent rule with memory, extending both i.i.d. random dynamics…
We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique…
Random constraint satisfaction problems can display a very rich structure in the space of solutions, with often an ergodicity breaking -- also known as clustering or dynamical -- transition preceding the satisfiability threshold when the…
Motivated by the concept of partial ergodicity, we present an alternative description of covalent and ionic glassy solids as statistical ensembles of crystalline local minima on the potential energy surface. We show analytically that the…
Herding is a deterministic algorithm used to generate data points that can be regarded as random samples satisfying input moment conditions. The algorithm is based on the complex behavior of a high-dimensional dynamical system and is…
Appeals to randomness in various number-theoretic constructions appear regularly in modern scientific publications. Such famous names as V.I. Arnold, M. Katz, Ya.G. Sinai, and T. Tao are just a few examples. Unfortunately, all of these…
Let $K$ be the Cantor set. We prove that arbitrarily close to a homeomorphism $T:K\rightarrow K$ there exists a homeomorphism $\widetilde T:K\rightarrow K$ such that the $\alpha$-limit and the $\omega$-limit of every orbit is a periodic…
This paper studies the fixed budget formulation of the Ranking and Selection (R&S) problem with independent normal samples, where the goal is to investigate different algorithms' convergence rate in terms of their resulting probability of…
We obtain the patch-repetition entropy Sigma within the Random First Order Transition theory (RFOT) and for the square plaquette system, a model related to the dynamical facilitation theory of glassy dynamics. We find that in both cases the…
Predicting the dynamical properties of topological matter is a challenging task, not only in theoretical and experimental settings, but also numerically. This work proposes a variational approach based on a time-dependent correlated Ansatz,…