Related papers: Horizon Visibility Graphs and Time Series Merge Tr…
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 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 limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. We extend this visibility graph and create a directed limited penetrable horizontal visibility graph and an image…
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…
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…
A visibility representation of a graph $G$ is an assignment of the vertices of $G$ to geometric objects such that vertices are adjacent if and only if their corresponding objects are "visible" each other, that is, there is an uninterrupted…
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…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
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…
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…
Visualizing time series in a dense spatial context such as a geographical map is a challenging task, which requires careful balance between the amount of depicted data and perceptual precision. Horizon graphs are a well-known technique for…
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…
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…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. In this paper, we introduce new algorithm of visibility, "cross-visibility", which reveals the conjugation of…
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…
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…
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…
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size $n.$ Our main results are formulas expressing the expected degree of graph nodes in…