Related papers: Horizontal Visibility graphs generated by type-II …
We generate new hierarchy of many-parameter family of maps of the interval [0,1] with an invariant measure, by composition of the chaotic maps of reference [1]. Using the measure, we calculate Kolmogorov-Sinai entropy, or equivalently…
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…
This study examines second-order dynamical systems incorporating Tikhonov regularization. It focuses on how nonlinearities induce bifurcations and chaotic dynamics. By using Lyapunov functions, bifurcation theory, and numerical simulations,…
Topological data analysis is an emerging area in exploratory data analysis and data mining. Its main tool, persistent homology, has become a popular technique to study the structure of complex, high-dimensional data. In this paper, we…
We improve on the description of the relationship that exists between critical clusters in thermal systems and intermittency near the onset of chaos in low-dimensional systems. We make use of the statistical-mechanical language of…
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…
Critical intermittency stands for a type of intermittent dynamics in iterated function systems, caused by an interplay of a superstable fixed point and a repelling fixed point. We consider critical intermittency for iterated function…
In this paper, we consider a renormalization group perspective on the quantum dynamics of a particle moving in the Euclidean $\mathbb{R}^N$ space through the complex landscape provided by a disordered Hamiltonian of type $2+p$. We focus on…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We consider the period-doubling and intermittency transitions in iterated nonlinear one-dimensional maps to corroborate unambiguously the validity of Tsallis' non-extensive statistics at these critical points. We study the map…
The spatio-temporal features of the velocity field of a fully-developed turbulent channel flow are investigated through the natural visibility graph (NVG) method, which is able to fully map the intrinsic structure of the time-series into…
In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…
This study examines the dynamical properties of the Ikeda map, with a focus on bifurcations and chaotic behavior. We investigate how variations in dissipation parameters influence the system, uncovering shrimp-shaped structures that…
In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting two dimensional timeseries into a planar…
The bifurcation transition is studied for the onset of intermittency analogous to the Pomeau-Manneville mechanism of type-I, but generalized for the presence of a quasiperiodic external force. The analysis is concentrated on the…
The horizontal visibility algorithm has been recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the…
The theory of pattern formation in reaction-diffusion systems is extended to the case of a directed network. Due to the structure of the network Laplacian of the scrutinised system, the dispersion relation has both real and imaginary parts,…
The stationary distributions of sums of positions of trajectories generated by the logistic map have been found to follow a basic renormalization group (RG) structure: a nontrivial fixed-point multi-scale distribution at the period-doubling…
We study the network replicator equation and characterize its fixed points on arbitrary graph structures for $2 \times 2$ symmetric games. We show a relationship between the asymptotic behavior of the network replicator and the existence of…