Counting Horizontal Visibility Graphs

Abstract

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 HVGs associated to data sequences without equal entries are completely determined by their ordered degree sequence. Moreover, we show that HVGs for data sequences without and with equal entries are counted by the Catalan numbers and the large Schröder numbers, respectively.

arXiv comment18 pages, 12 figures

References in corpus (7)

• From time series to complex networks: the visibility graph
• Time series irreversibility: a visibility graph approach
• A characterization of horizontal visibility graphs and combinatorics on words
• Unveiling temporal correlations characteristic to phase transition in the intensity of a fibre laser radiation
• Fully Developed Turbulence in the view of Horizontal Visibility Graphs
• Canonical Horizontal Visibility Graphs are uniquely determined by their degree sequence
• Efficient On-line Computation of Visibility Graphs