相关论文: Quasiperiodic graphs at the onset of chaos
We analyze the properties of the self-similar network obtained from the trajectories of unimodal maps at the transition to chaos via the horizontal visibility (HV) algorithm. We first show that this network is uniquely determined by the…
Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown…
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions…
The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a…
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…
Visibility algorithms are a family of geometric and ordering criteria by which a real-valued time series of N data is mapped into a graph of N nodes. This graph has been shown to often inherit in its topology non-trivial properties of the…
In this contribution we study the onset of chaos via type-II intermittency within the framework of Horizontal Visibility graph theory. We construct graphs associated to time series generated by an iterated map close to a Neimark-Sacker…
A Horizontal Visibility Graph (HVG) is a simple graph extracted from an ordered sequence of real values, and this mapping has been used to provide a combinatorial encryption of time series for the task of performing network based time…
We review the occurrence of the patterns of the onset of chaos in low-dimensional nonlinear dissipative systems in leading topics of condensed matter physics and complex systems of various disciplines. We consider the dynamics associated…
Transitions to chaos in archetypal low-dimensional nonlinear maps offer real and precise model systems in which to assess proposed generalizations of statistical mechanics. The known association of chaotic dynamics with the structure of…
We consider a model for chaotic diffusion with amplification on graphs associated with piecewise-linear maps of the interval. We investigate the possibility of having power-law tails in the invariant measure by approximate solution of the…
We analyze the fluctuating dynamics at the golden-mean transition to chaos in the critical circle map and find that trajectories within the critical attractor consist of infinite sets of power laws mixed together. We elucidate this…
Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…
We introduce the $\alpha$-Gauss-Logistic map, a new nonlinear dynamics constructed by composing the logistic and $\alpha$-Gauss maps. Explicitly, our model is given by $x_{t+1} = f_L(x_t)x_t^{-\alpha} - \lfloor f_L(x_t)x_t^{-\alpha} \rfloor…
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows to apply methods of complex network theory for characterizing time series. In this work we present the…
Dynamics of coupled chaotic oscillators on a network are studied using coupled maps. Within a broad range of parameter values representing the coupling strength or the degree of elements, the system repeats formation and split of coherent…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
We investigate signatures of quantum chaos in the mixed-field quantum Ising model on finite-size Erd\H{o}s-R\'enyi graphs using probes scalable on near-term quantum devices. By tuning the graph connectivity, the system exhibits a crossover…
We consider bipartite tight-binding graphs composed by $N$ nodes split into two sets of equal size: one set containing nodes with on-site loss, the other set having nodes with on-site gain. The nodes are connected randomly with probability…
We investigate the probability density of rescaled sum of iterates of sine-circle map within quasi-periodic route to chaos. When the dynamical system is strongly mixing (i.e., ergodic), standard Central Limit Theorem (CLT) is expected to be…