Related papers: Metric mean dimension of factor maps
In this article, we continue the structural study of factor maps betweeen symbolic dynamical systems and the relative thermodynamic formalism. Here, one is studying a factor map from a shift of finite type $X$ (equipped with a potential…
Around the mean dimensions and rate-distortion functions, using some tools from local entropy theory this paper establishes the following main results: $(1)$ We prove that for non-ergodic measures associated with almost sure processes, the…
In the finite dimensional case, mean-type mappings, their invariant means, relations between the uniqueness of invariant means and convergence of orbits of the mapping, are considered. In particular it is shown, that the uniqueness of an…
In this paper we study the dimension spectrum of general conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We perform a comprehensive study of the dimension spectrum addressing questions…
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…
We introduce two parametrized families of piecewise affine maps on $[0,1]^2$ and $[0,1]^3$, as generalizations of the heterochaos baker maps which were introduced and investigated in [Y. Saiki, H. Takahasi, J. A. Yorke, Nonlinearity, 34…
Several important aspects of software product quality can be evaluated using dynamic metrics that effectively capture and reflect the software's true runtime behavior. While the extent of research in this field is still relatively limited,…
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…
Entropy dimension is an entropy-type quantity which takes values in $[0,1]$ and classifies different levels of intermediate growth rate of complexity for dynamical systems. In this paper, we consider the complexity of skew products of…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
Given a compact metric space $X$ and a continuous map $T: X \to X$, the induced hyperspace map $T_\mathcal{K}$ acts on the hyperspace $\mathcal{K}(X)$ of nonempty closed sets of $X$, and the measure-induced map $T_*$ acts on the space of…
Let $X$ be a full-shift on the alphabet $[0, 1]^a$ and let $(Y, S)$ be an arbitrary dynamical system. We prove that any equivariant continuous map from $X$ to $Y$ has conditional metric mean dimension not less than $a-\mathrm{mdim}(Y, S)$.…
Porosity and dimension are two useful, but different, concepts that quantify the size of fractal sets and measures. An active area of research concerns understanding the relationship between these two concepts. In this article we will…
In this note, we generalise the concept of topo-isomorphic extensions and define finite topomorphic extensions as topological dynamical systems whose factor map to the maximal equicontinuous factor is measure-theoretically at most…
We propose a new definition of preimage entropy dimension for continuous maps on compact metric spaces, investigate fundamental properties of the preimage entropy dimension, and compare the preimage entropy dimension with the topological…
A type of fractal dimension definition is based on the generalized entropy function. Both entropy and fractal dimension can be employed to characterize complex spatial systems such as cities and regions. Despite the inherent connect between…
We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the…
The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric dimension for two…
Given $X$ a compact metric space and $T: X \to X$ a continuous map, the induced hyperspace map $T_\mathcal{K}$ acts on the hyperspace $\mathcal{K}(X)$ of closed and nonempty subsets of $X$, and on the continuum hyperspace $\mathcal{C}(X)…
This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive…