12,764 research outputs found

    Homoclinic orbits, and self-excited and hidden attractors in a Lorenz-like system describing convective fluid motion

    Full text link
    In this tutorial, we discuss self-excited and hidden attractors for systems of differential equations. We considered the example of a Lorenz-like system derived from the well-known Glukhovsky--Dolghansky and Rabinovich systems, to demonstrate the analysis of self-excited and hidden attractors and their characteristics. We applied the fishing principle to demonstrate the existence of a homoclinic orbit, proved the dissipativity and completeness of the system, and found absorbing and positively invariant sets. We have shown that this system has a self-excited attractor and a hidden attractor for certain parameters. The upper estimates of the Lyapunov dimension of self-excited and hidden attractors were obtained analytically.Comment: submitted to EP

    Horizontal Visibility graphs generated by type-I intermittency

    Get PDF
    The type-I intermittency route to (or out of) chaos is investigated within the Horizontal Visibility graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct, according to the Horizontal Visibility algorithm, their associated graphs. We show how the alternation of laminar episodes and chaotic bursts has a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values of several network parameters. In particular, we predict that the characteristic power law scaling of the mean length of laminar trend sizes is fully inherited in the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of the block entropy over the degree distribution. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization group framework, where the fixed points of its graph-theoretical RG flow account for the different types of dynamics. We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibit extremal entropic properties.Comment: 8 figure

    Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

    Full text link
    We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. Firstly we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the R\"ossler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structures -- thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length and network diameter are highly sensitive to the interior crisis captured in this particular data set
    • 

    corecore