A characterization of horizontal visibility graphs and combinatorics on words
arXiv:1010.1850 · doi:10.1016/j.physa.2011.02.031
Abstract
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 randomness and chaos [B. Luque, et al., Phys. Rev. E 80 (2009), 046103]. We prove that a graph is an HVG if and only if outerplanar and has a Hamilton path. Therefore, an HVG is a noncrossing graph, as defined in algebraic combinatorics [P. Flajolet and M. Noy, Discrete Math., 204 (1999) 203-229]. Our characterization of HVGs implies a linear time recognition algorithm. Treating ordered sets as words, we characterize subfamilies of HVGs highlighting various connections with combinatorial statistics and introducing the notion of a visible pair. With this technique we determine asymptotically the average number of edges of HVGs.
6 pages
References in corpus (4)
- From time series to complex networks: the visibility graph
- Description of stochastic and chaotic series using visibility graphs
- From the time series to the complex networks: the parametric (dynamical) natural visibility graph
- Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
Cited by in corpus (27)
- Complex network approaches to nonlinear time series analysis
- Time series irreversibility: a visibility graph approach
- Feigenbaum graphs: a complex network perspective of chaos
- From the time series to the complex networks: the parametric (dynamical) natural visibility graph
- Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
- Visibility graphs for image processing
- Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
- Sequential visibility-graph motifs
- Detecting series periodicity with horizontal visibility graphs
- On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches
- Time Series Analysis via Network Science: Concepts and Algorithms
- Sequential motif profile of natural visibility graphs
- Visibility graphs and symbolic dynamics
- Visibility graphs of random scalar fields and spatial data
- Canonical Horizontal Visibility Graphs are uniquely determined by their degree sequence
- A Visibility Graph Averaging Aggregation Operator
- Inferring dissipation from the violation of Fluctuation-Dissipation Theorem
- Theoretical results on the topological properties of the limited penetrable horizontal visibility graph family
- Approximate entropy of network parameters
- Horizontal Visibility graphs generated by type-II intermittency
- On the spectral properties of Feigenbaum graphs
- Advancing Through Terrains
- Persistent Graphs and Cyclic Polytope Triangulations
- Horizon Visibility Graphs and Time Series Merge Trees are Dual
- Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs
- Hierarchical deposition and scale-free networks: a visibility algorithm approach
- Counting Horizontal Visibility Graphs