相关论文: Analytic degree distributions of horizontal visibi…

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…

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 visibility graph (VG) algorithm and its variants have been extensively studied in the time series analysis as they transform the time series into the network of nodes and links, enabling to characterize the time series in terms of…

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility…

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 dynamics of a complex system is usually recorded in the form of time series, which can be studied through its visibility graph from a complex network perspective. We investigate the visibility graphs extracted from fractional Brownian…

We present the modification of natural visibility graph (NVG) algorithm used for the mapping of the time series to the complex networks (graphs). We propose the parametric natural visibility graph (PNVG) algorithm. The PNVG consists of NVG…

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…

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…

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…

Horizontal visibility graphs (HVGs, for short) are a common tool used in the analysis and classification of time series with applications in many scientific fields. In this article, extending previous work by Lacasa and Luque, we prove that…

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…

In this work we present a simple and fast computational method, the visibility algorithm, that converts a time series into a graph. The constructed graph inherits several properties of the series in its structure. Thereby, periodic series…

In this work, we introduce a new and simple transformation from time series to complex networks based on markov-binary visibility graph(MBVG). Due to the simple structure of this transformation in comparison with other transformations be…

Network motif analysis is a useful tool for the investigation of complex networks. We study the profiles of tetradic motifs in horizontal visibility graphs (HVGs) converted from multifractal binomial measures, fractional Gaussian noises,…

It is possible to investigate emergence in many real systems using time-ordered data. However, classical time series analysis is usually conditioned by data accuracy and quantity. A modern method is to map time series onto graphs and study…

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…

The limited penetrable horizontal visibility algorithm is a new time analysis tool and is a further development of the horizontal visibility algorithm. We present some exact results on the topological properties of the limited penetrable…

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…

Visibility Graph (VG) transforms time series into graphs, facilitating signal processing by advanced graph data mining algorithms. In this paper, based on the classic Limited Penetrable Visibility Graph (LPVG) method, we propose a novel…