Abstract
We suggest a network representation of dynamical maps (such as the logistic map) on the unit interval. The unit interval is partitioned into Nsubintervals, which are associated with 'nodes' of the network. A link from node ito jis defined as a possible transition of the dynamical map from one interval i, to another j. In this way directed networks more generally allow phasespace representations (i.e. representations of transitions between different phasespace cells), of dynamical maps defined on finite intervals. We compute the diameter of these networks as well as the average path length between any two nodes. We numerically demonstrate that these network characteristics seem to diverge at the (first) zeros of the Lyapunov exponent and could thus provide an alternative measure to detect the 'edge of chaos' in dynamical systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
