Related papers: On dynamics of graph maps with zero topological en…
We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…
The relevance of the algebraic entropy in the study of birational discrete time dynamical systems highlights the need to relate it to other characteristics of these systems. In this letter, two complementary proofs are given that the…
Co-compact entropy is introduced as an invariant of topological conjugation for perfect mappings defined on any Hausdorff space(compactness and metrizability not necessarily required). This is achieved through the consideration of…
We address the problem of testing whether a dynamic graph is temporally connected, i.e. a temporal path ({\em journey}) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
We present a dichotomy for surface homeomorphisms in the isotopy class of the identity. We show that, in the absence of a degenerate fixed point set, either there exists a uniform bound on the diameter of orbits of non-wandering points for…
In this paper we study topological entropy and recurrence properties of non-autonomous dynamical system generated by a family of continuous self maps on a compact space X. Specially, we introduce the pseudo-entropy and…
In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
We study the directional entropy of the dynamical system associated to a $\Z^2$ configuration in a finite alphabet. We show that under local assumptions on the complexity, either every direction has zero topological entropy or some…
Given a closed, orientable surface of constant negative curvature and genus $g \ge 2$, we study a family of generalized Bowen-Series boundary maps and prove the following rigidity result: in this family the topological entropy is constant…
We show that every dendrite satisfying the condition that no subtree of it contains all free arcs admits a transitive, even exactly Devaney chaotic map with arbitrarily small entropy. This gives a partial answer to a question of Baldwin…
The recent extension of permutation entropy and its derivatives to graph signals has opened up new horizons for the analysis of complex, high-dimensional systems evolving on networks. However, these measures are all fundamentally rooted in…
We study a class of asymptotically entropy-expansive $C^1$ diffeomorphisms with dominated splitting on a compact manifold $M$, that satisfy the specification property. This class includes, in particular, transitive Anosov diffeomorphisms…
We study dimension theory for the $C^*$-algebras of row-finite $k$-graphs with no sources. We establish that strong aperiodicity - the higher-rank analogue of condition (K) - for a $k$-graph is necessary and sufficient for the associated…
In the family of area-contracting H\'enon-like maps with zero topological entropy we show that there are maps with infinitely many moduli of stability. Thus one cannot find all the possible topological types for non-chaotic area-contracting…
The main result of this paper states, that if a function $f:\R^2\to [0, +\infty)$ has a closed graph and the set of discontinuity points is a network (as defined by Kuratowski in Topology II, 61.IV), then the graph of $f$ is disconnected.…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that…