相关论文: On the spectral properties of Feigenbaum graphs

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…

Horizontal visibility graphs (HVGs) are graphs constructed in correspondence with number sequences that have been introduced and explored recently in the context of graph-theoretical time series analysis. In most of the cases simple…

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…

An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between…

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…

The concept of sequential visibility graph motifs -subgraphs appearing with characteristic frequencies in the visibility graphs associated to time series- has been advanced recently along with a theoretical framework to compute analytically…

A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque {\it et al.}, Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa {\it et…

Recent works have established a novel viewpoint that treats the eigenvalue spectra of disordered quantum systems as time-series, and corresponding algorithms such as singular-value-decomposition has proven its advantage in studying subtle…

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…

The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…

Complex network is not only a powerful tool for the analysis of complex system, but also a promising way to analyze time series. The algorithm of horizontal visibility graph (HVG) maps time series into graphs, whose degree distributions are…

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…

We examine the connectivity fluctuations across networks obtained when the horizontal visibility (HV) algorithm is used on trajectories generated by nonlinear circle maps at the quasiperiodic transition to chaos. The resultant HV graph is…

A new alternative method to approximate the Visibility Graph (VG) of a time series has been introduced here. It exploits the fact that most of the nodes in the resulting network are not connected to those that are far away from them. This…

{We focus on characterizing the high-energy emission mechanisms of blazars by analyzing the variability in the radio band of the light curves of more than a thousand sources. We are interested in assigning complexity parameters to these…

The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum…

Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…

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 work, we investigate a range of time series, including Gaussian noises (white, pink, and blue), stochastic processes (Ornstein-Uhlenbeck, fractional Brownian motion, and Levy flights), and chaotic systems (the logistic map), using…

Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same…