Related papers: Asymptotic uniform complexity and amenability
We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…
We study asymptotically harmonic manifolds of negative curvature, without any cocompactness or homogeneity assumption. We show that asymptotic harmonicity provides a lot of information on the asymptotic geometry of these spaces: in…
We obtain exact analytic expressions for a class of functions expressed as integrals over the Haar measure of the unitary group in d dimensions. Based on these general mathematical results, we investigate generic dynamical properties of…
We show that the dynamic asymptotic dimension of a minimal free action of an infinite virtually cyclic group on a compact Hausdorff space is always one. This extends a well-known result of Guentner, Willett, and Yu for minimal free actions…
In this paper we establish asymptotic (biasymptotic) equivalence between spaces of solutions of a given linear homogeneous system and a perturbed system. The perturbations are of either linear or weakly linear characters. Existence of a…
Uniformity and proximity are two different ways for defining small scale structures on a set. Coarse structures are large scale counterparts of uniform structures. In this paper, motivated by the definition of proximity, we develop the…
We give a short geometric proof of a result of Soardi & Woess and Salvatori that a quasitransitive graph is amenable if and only if its automorphism group is amenable and unimodular. We also strengthen one direction of that result by…
The fundamental inequality of Guivarc'h relates the entropy and the drift of random walks on groups. It is strict if and only if the random walk does not behave like the uniform measure on balls. We prove that, in any nonelementary…
We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity…
In this paper, we aim to investigate the synchronization problem of dynamical systems, which can be of generic linear or Lipschitz nonlinear type, communicating over directed switching network topologies. A mild connectivity assumption on…
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…
In this note we study some properties of topological entropy for non-compact non-metrizable spaces. We prove that if a uniformly continuous self-map $f$ of a uniform space has topological shadowing property then the map $f$ has positive…
The universal symmetry, or conservation, of complexity underlies any law or principle of system dynamics and describes the unceasing transformation of dynamic information into dynamic entropy as the unique way to conserve their sum, the…
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…
We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…
We consider the dynamics of an arbitrary quantum system coupled to a large arbitrary and fully quantum mechanical environment through a random interaction. We establish analytically and check numerically the typicality of this dynamics, in…
We show that for every topological dynamical system with the approximate product property, zero topological entropy is equivalent to unique ergodicity. Equivalence of minimality is also proved under a slightly stronger condition. Moreover,…
We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…
Given a tree map $f:T\to T$, we study the dynamics of subcontinua of $T$ under action of $f$. In particular, we prove that a subcontinuum of $T$ is either asymptotically periodic or asymptotically degenerate. As an application of this…
Measurement data is often sampled irregularly i.e. not on equidistant time grids. This is also true for Hamiltonian systems. However, existing machine learning methods, which learn symplectic integrators, such as SympNets [20] and…