scholarly journals A characterization of horizontal visibility graphs and combinatorics on words

2011 ◽  
Vol 390 (12) ◽  
pp. 2421-2428 ◽  
Author(s):  
Gregory Gutin ◽  
Toufik Mansour ◽  
Simone Severini
2013 ◽  
Vol 11 (2) ◽  
Author(s):  
Ligia Cristea ◽  
Helmut Prodinger

AbstractWe investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics on words, Phys. A, 2011, 390 (12), 2421–2428], and for words over a finite alphabet the formula obtained in the present paper for the expectation is more precise than that obtained in the cited paper. More importantly, we also compute the variance for each case.


2016 ◽  
Vol 444 ◽  
pp. 1003-1011 ◽  
Author(s):  
A.C. Braga ◽  
L.G.A. Alves ◽  
L.S. Costa ◽  
A.A. Ribeiro ◽  
M.M.A. de Jesus ◽  
...  

2017 ◽  
Vol 119 (4) ◽  
pp. 48008 ◽  
Author(s):  
Wen-Jie Xie ◽  
Rui-Qi Han ◽  
Zhi-Qiang Jiang ◽  
Lijian Wei ◽  
Wei-Xing Zhou

2012 ◽  
Vol 22 (07) ◽  
pp. 1250160 ◽  
Author(s):  
ANGEL NUÑEZ ◽  
LUCAS LACASA ◽  
EUSEBIO VALERO ◽  
JOSE PATRICIO GÓMEZ ◽  
BARTOLO LUQUE

The horizontal visibility algorithm was 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 powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore such graph theoretical characterization is in principle possible. However, both the mathematical grounding of this promising theory and its applications are in its infancy. Following this line, here we address the question of detecting hidden periodicity in series polluted with a certain amount of noise. We first put forward some generic properties of horizontal visibility graphs which allow us to define a (graph theoretical) noise reduction filter. Accordingly, we evaluate its performance for the task of calculating the period of noisy periodic signals, and compare our results with standard time domain (autocorrelation) methods. Finally, potentials, limitations and applications are discussed.


2019 ◽  
Vol 29 (7) ◽  
pp. 073119 ◽  
Author(s):  
Zhong-Ke Gao ◽  
Wei Guo ◽  
Qing Cai ◽  
Chao Ma ◽  
Yuan-Bo Zhang ◽  
...  

2013 ◽  
Vol 47 (3) ◽  
pp. 035102 ◽  
Author(s):  
Ángel M Núñez ◽  
Lucas Lacasa ◽  
Jose Patricio Gómez

Sign in / Sign up

Export Citation Format

Share Document