SYMBOLIC DYNAMICS GENERATED BY A COMBINATION OF GRAPHS
From MaRDI portal
Abstract: In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify conditions for a stretched exponential type of growth. This is made possible by combining two or more graphs over the same alphabet, in order to obtain a discrete dynamical system generated by a triangular map, which can also be interpreted as a discrete non-autonomous system. Since the vertices and the edges of a graph usually are used to depict the states and transitions between states of a discrete dynamical system, the combination of two (or more) graphs can be interpreted as the driving, or perturbation, of one system by another.
Recommendations
- Symbolic dynamics and the category of graphs
- Visibility graphs and symbolic dynamics
- scientific article; zbMATH DE number 2158945
- Dynamics of symbol systems
- Symbolic dynamics and characterization of complexity
- Symbolic dynamics of tree maps
- scientific article; zbMATH DE number 2158944
- Application of infinite labeled graphs to symbolic dynamical systems
- Computable symbolic dynamics
- On graph induced symbolic systems
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Conditional entropy of some automatic sequences
- DYNAMICAL ASPECTS OF INTERACTION NETWORKS
- scientific article; zbMATH DE number 936158 (Why is no real title available?)
- Recurrent sets
- Scaling behaviour of entropy estimates
- Substitution dynamical systems - spectral analysis
- Super-selection rules modulating complexity: an overview
- Word frequency and entropy of symbolic sequences: A dynamical perspective
Cited in
(3)
This page was built for publication: SYMBOLIC DYNAMICS GENERATED BY A COMBINATION OF GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322540)