The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index; none of the 9 sources its claims cite is checked for support yet.
From time series to complex networks: the visibility graph
Open accessAbstract
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 convert into regular graphs, and random series do so into random graphs. Moreover, fractal series convert into scale-free networks, enhancing the fact that power law degree distributions are related to fractality, something highly discussed recently. Some remarkable examples and analytical tools are outlined to test the method's reliability. Many different measures, recently developed in the complex network theory, could by means of this new approach characterize time series from a new point of view.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper introduces the visibility algorithm, which maps a time series into a graph by connecting data points that can “see” each other without intermediate heights blocking the line of sight. It shows that periodic series yield regular graphs, random series yield random graphs with exponential degree tails, and fractal series yield scale-free visibility graphs.
Key findings
- Periodic time series map to regular graphs whose discrete degree distribution has peaks related to the series period; the example in Fig. 1 is a period-4 series.
- A random series of \(10^6\) data from \(U[0,1]\) produces a visibility graph whose degree distribution has an exponential tail, attributed to rare large values acting as hubs.
- Brownian motion visibility graphs are scale-free with \(P(k) \sim k^{-\alpha}\), \(\alpha = 2.00 \pm 0.01\), and show a Small-World effect with \(L(N) = 1.21 + 0.51\log(N)\).
- Conway series visibility graphs are scale-free with \(\alpha = 1.2 \pm 0.1\) and scale-invariant path length \(L(N) = 0.76 N^{0.38}\); a deterministic fractal example is also shown analytically to yield a power-law degree distribution.
Methods
- The visibility algorithm maps each time-series datum to a node and links two nodes if the straight line between their data values does not intersect any intermediate data height.
- The paper analyzes periodic series, a random series of \(10^6\) points from \(U[0,1]\), Brownian motion of \(10^6\) data, a Conway series of \(4 \cdot 10^6\) data, and a deterministic iterated fractal series.
- Main analyses include degree distributions \(P(k)\), mean path length \(L(N)\), and analytical recurrence relations for the deterministic fractal example.
Limitations
- The paper states that information is inevitably lost because the network structure is completely determined by the binary adjacency matrix; for example, periodic series \(T_1 = \{\ldots,3,1,3,1,\ldots\}\) and \(T_2 = \{\ldots,3,2,3,2,\ldots\}\) have the same visibility graph despite being quantitatively different.
- The paper states that it only tackles undirected graphs, while a directed version related to temporal axis direction is left for further work.
- The paper notes that the simple deterministic fractal example does not provide a general explanation of why fractality translates into power-law distributions, though it may stand as a generic way to deal with deterministic fractal series generated by iteration.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Own interpretation · 7 No basis given · 6 Own result · 4 Sources not found · 1 No full text of the sources · 1 Not checked yet · 1 Own method
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The degree distribution of this graph is formed by a finite number of peaks related to the series period, much in the vein of the Fourier Power Spectrum of a time series.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“( iii ) invariant under affine transformations of the series data: the visibility criterium is invariant under rescaling of both horizontal and vertical axis, as well as under horizontal and vertical translations (see figure 2).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The tail of this distribution fits quite well an exponential distribution, as expected.”
- Also stated in: § Resumen · p. 3 · plain
“random series convert into exponential random graphs”
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Resumen · p. 3 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In this letter we introduce a new tool in time series analysis: the visibility graph . This algorithm maps a time series into a network.”
- Also stated in: § Resumen · p. 1 · plain
“the visibility algorithm , that converts a time series into a graph.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Resumen · p. 1 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“( ii ) undirected: the way the algorithm is built up, there is no direction defined in the links.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“( i ) connected: each node sees at least its nearest neighbors (left and right).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This one is a power law P ( k ) ∼ k -α with α = 1 , 2 ± 0 , 1.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“that is, the degree distribution related to the C-nodes is a power law.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This one is a power law P ( k ) ∼ k -α with α = 2 , 00 ± 0 , 01.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is indeed due to these 'unlikely' large values (the hubs) that the tail of the degree distribution deviates from the Poisson distribution.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 6
- Probably not a substantial claim. 3
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“while the Brownian visibility graph seems to evidence the SmallWorld effect (right top figure 4) as L ( N ) ∼ log( N )”
- Also stated in: § Referencias · p. 12 · plain
“The best fitting provides a logarithmic scaling L ( N ) = 1 , 21 + 0 , 51log( N ). This network shows Small-World effect in addition to be scale-free.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § Referencias · p. 12 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“the Conway series shows in turn a self-similar relation (right bottom figure 4) of the shape L ( N ) ∼ N β”
- Also stated in: § Referencias · p. 12 · plain
“The best fitting provides a power law scaling L ( N ) = 0 , 76 N 0 , 38 . Then, this network is scale-invariant.”
plaincorrelationalSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § Referencias · p. 12 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“nodes A and B have typically the same degree.”
- Also stated in: § Resumen · p. 4 · plain
“The degree of A and B is the same as the right degree of C”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § Resumen · p. 4 · plain
In the paper
“Note that this summation agrees with the number of irreducible polynomials of degree at most n over the Galois field GF(2) [20]”
What the sources say
- Not checked — no full text of the sourcecites [20] K.H. Hicks, G.L. Mullen, and I. Sato, Distribution of irreducible polynomials over F 2 , in Finite Fields with Applications to Coding Theory, Cryptography and Related Areas (Oaxaca, 2001), 177-186, Springer, Berlin, 2002. source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“some other fractal series have been also studied (Q series [16], Stern series [17], Thue-Morse series [18], etc) with similar results.”
What the sources say
- Not checked — no full text of the sourcecites [16] D. Hofstadter, G¨ odel, Escher, Bach , New York: Vintage Books, pp. 137-138 (1980).
- Not matchedcites [17] M.A. Stern, J. Reine Angew. Math. , 55, pp. 193-220 (1858).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites [18] M.R. Schroeder, Fractals, Chaos, and Power Laws , New York: W. H. Freeman (1991).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“the method captures the hub repulsion phenomenon associated to fractal networks [8] and thus distinguishes scale free visibility graphs evidencing Small-World effect from those showing scale invariance.”
What the sources say
- Not matchedcites [8] C. Song, S. Havlin, H.A. Makse, Nat. Phys. 2 ,275 (2006).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The structure of the time series is conserved in the graph topology: periodic series convert into regular graphs, random series into random graphs and fractal series into scale-free graphs.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we may argue that the visibility graph can actually distinguish different types of fractality”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“In every case the algorithm captures the random nature of the series, and the particular shape of the degree distribution of the visibility graph is related to the particular random process [4].”
What the sources say
- Not matchedcites [4]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Not matched
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The resulting visibility graph has characteristics that reflect the equivalent time series temporal structure and can be used to identify trends.”
From PyIOmica: longitudinal omics analysis and trend identification (2020) · cites this paper as Lacasa et al., 2008
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Recent work on characterizing complex events focuses on using network/graph methodology that can capture non-linear behavior (Lacasa et al., 2008).”
From PyIOmica: longitudinal omics analysis and trend identification (2020) · cites this paper as Lacasa et al., 2008
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The challenges in capturing relationships and dependencies among emotions indicate the necessity for an architecture that is both easy to construct and preserves the structure of the underlying signal in its topology to improve both performance and interpretability [21], [22].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In VVG, edge directionality stems from the projection-based asymmetry between multidimensional vectors.When M = 1, vectors reduce to scalars, eliminating projections and making visibility symmetric, resulting in an undirected graph [22], [25].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Time series are transformed into networks that conserve their topology, and allow the identification of varying temporal structures.”
From PyIOmica: longitudinal omics analysis and trend identification (2020) · cites this paper as Lacasa et al., 2008
The cited source says what the claim attributes to it.
In the citing paper
“To this end, visibility graphs offer an effective means of representing sequential signals by connecting data points according to their value-based visibility, thereby preserving the underlying temporal structure while introducing geometric relationships [22], [23].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“The vector visibility graph (VVG) algorithm [25] extends the univariate visibility graph [22], [24] concept to multivariate time series data”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“This simple yet versatile transformation supports both scalar [22], [24] and vector representations [25], with applications spanning time series analysis and language processing [26], [27].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“The natural visibility graph (NVG) algorithm [22] is a foundational method for mapping univariate (scalar) time series into graph networks.”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,621
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
An Introduction to Probability Theory and its Applications.
Kingmán, J. F. C., & Feller, W. (1972) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344620 · Cited by 5,297
Bollobás, B. (1998) · Graduate texts in mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,867
An Introduction to Probability Theory.
Fristedt, B. E., & Moran, P. A. P. (1986) · Journal of the American Statistical Association · doi:10.2307/2288022 · Cited by 3,358
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances In Physics · doi:10.1080/00018730110112519 · Cited by 3,219
Research works printed but not linked: 2
- J Conway Some Crazy Sequences, 1988).
- MA Stern J Reine Angew Math 55, 193–220 (1858).
Cited by
Sorted by citations
Items 701–800 of 1,826
Gao, L., Hu, Z., Li, R., et al. (2022) · Brain Sciences · doi:10.3390/brainsci12101348 · Cited by 11
Wu, S., Liang, M., Wang, X., & Chen, Q. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119942 · Cited by 12
Can recurrence networks show small-world property?
Jacob, R., Harikrishnan, K. P., Misra, R., et al. (2016) · Physics Letters A · doi:10.1016/j.physleta.2016.06.038 · Cited by 11
The Multiscale Fluctuations of the Correlation between Oil Price and Wind Energy Stock
Huang, S., An, H., Gao, X., et al. (2016) · Sustainability · doi:10.3390/su8060534 · Cited by 11
Phase transition in the parametric natural visibility graph
Snarskii, A. A., & Bezsudnov, I. V. (2016) · Physical review. E · doi:10.1103/physreve.94.042137 · Cited by 11
Investors’ Behavior on S&P 500 Index During Periods of Market Crashes: A Visibility Graph Approach
Vamvakaris, M. D., Pantelous, A. A., & Zuev, K. M. (2017) · Elsevier eBooks · doi:10.1016/b978-0-12-811252-6.00022-0 · Cited by 11
Network Inference and Maximum Entropy Estimation on Information Diagrams
Martin, E. A., Hlinka, J., Meinke, A., et al. (2017) · Scientific Reports · doi:10.1038/s41598-017-06208-w · Cited by 11
Ahmadi, N., Pei, Y., & Pechenizkiy, M. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.01.003 · Cited by 11
Pérez-Oregon, J., Muñoz-Diosdado, A., Rudolf-Navarro, A., et al. (2019) · Pure and Applied Geophysics · doi:10.1007/s00024-019-02320-2 · Cited by 11
A sliding window-based algorithm for faster transformation of time series into complex networks
Carmona-Cabezas, R., Gómez-Gómez, J., de Ravé, E. G., et al. (2019) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5112782 · Cited by 11
Directed weighted complex networks based on time series symbolic pattern representation
Zeng, M., Er-Hong, W., Ming-Yuan, Z., et al. (2017) · Acta Physica Sinica · doi:10.7498/aps.66.210502 · Cited by 11
Detecting time lag between a pair of time series using visibility graph algorithm
John, M., & Ferbinteanu, J. (2021) · Communications in Statistics Case Studies Data Analysis and Applications · doi:10.1080/23737484.2021.1882356 · Cited by 11
Analysis of pulsating variable stars using the visibility graph algorithm
Muñoz, V., & Garcés, E. (2021) · PLoS ONE · doi:10.1371/journal.pone.0259735 · Cited by 11
Zhang, L., Su, H., Zio, E., Jiang, L., Fan, L., & Zhang, J. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119039 · Cited by 11
VISIBILITY GRAPHS FOR TIME SERIES CONTAINING DIFFERENT COMPONENTS
Qi, J., Wang, J., Wang, J., et al. (2011) · Fluctuation and Noise Letters · doi:10.1142/s0219477511000636 · Cited by 11
Construction of complex networks from time series based on the cross correlation interval
Feng, C., & He, B. (2017) · Open Physics · doi:10.1515/phys-2017-0028 · Cited by 11
Contact graphs of disk packings as a model of spatial planar networks
Zhang, Z., Guan, J., Ding, B., Chen, L., & Zhou, S. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/8/083007 · Cited by 11
Irreversibility of financial time series: a case of crisis
Бєлінський, А. О., Hushko, S. V., Matviychuk, A. V., et al. (2021) · doi:10.31812/123456789/6975 · Cited by 11
PyIOmica: longitudinal omics analysis and trend identification
Domanskyi, S., Piermarocchi, C., & Mias, G. I. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz896 · Cited by 10
Distinguish between Stochastic and Chaotic Signals by a Local Structure-Based Entropy
Zhang, Z., Wu, J., Chen, Y., Wang, J., & Xu, J. (2022) · Entropy · doi:10.3390/e24121752 · Cited by 10
Hernandez, C. I., Kargarnovin, S., Hejazi, S., & Karwowski, W. (2023) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2023.1207067 · Cited by 11
Sliding limited penetrable visibility graph for establishing complex network from time series
Wang, S., Li, P., Chen, G., et al. (2024) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0186562 · Cited by 10
Su, J., Wang, W., Bai, Y., et al. (2024) · Energy · doi:10.1016/j.energy.2024.134133 · Cited by 10
Mohammadpoory, Z., Nasrolahzadeh, M., & Amiri, S. A. (2025) · Multimedia Tools and Applications · doi:10.1007/s11042-025-20594-8 · Cited by 10
Nartallo-Kaluarachchi, R., Bonetti, L., Fernández‐Rubio, G., Vuust, P., Deco, G., Kringelbach, M. L., Lambiotte, R., & Goriely, A. (2025) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2408791122 · Cited by 11
The study of network motifs induced from discrete time series
Zhao, D., Li, X., & 200433, 复. (2010) · Acta Physica Sinica · doi:10.7498/aps.59.1600 · Cited by 10
VISIBILITY GRAPHS FROM EXPERIMENTAL THREE-PHASE FLOW FOR CHARACTERIZING DYNAMIC FLOW BEHAVIOR
Gao, Z., Du, M., Hu, L.-D., et al. (2012) · International Journal of Modern Physics C · doi:10.1142/s0129183112500696 · Cited by 10
Derivative-variable correlation reveals the structure of dynamical networks
Levnajić, Z. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-30986-5 · Cited by 10
Row—column visibility graph approach to two-dimensional landscapes
Xiao, Q., Pan, X., Li, X., et al. (2014) · Chinese Physics B · doi:10.1088/1674-1056/23/7/078904 · Cited by 10
Catastrophe Pre-Warning of Multi-Modular Floating Platforms with Ordinal Partition Networks
Yang, G., Xu, D., & Zhang, H. (2020) · International Journal of Computational Methods · doi:10.1142/s0219876220500103 · Cited by 10
Alternatives selection for produced water management: A network-based methodology
Mao, S., Deng, Y., & Pelusi, D. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103556 · Cited by 10
Time Series Clustering: A Complex Network-Based Approach for Feature Selection in Multi-Sensor Data
Bonacina, F., Miele, E. S., & Corsini, A. (2020) · Modelling · doi:10.3390/modelling1010001 · Cited by 14
Analysis of the attention to COVID-19 epidemic based on visibility graph network
Feng, Q., Wei, H., Hu, J., et al. (2021) · Modern Physics Letters B · doi:10.1142/s0217984921503164 · Cited by 10
Wu, X., Wu, Z., & Hu, J. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127672 · Cited by 10
Device-Free Indoor Localization of CSI Based on Limited Penetrable Horizontal Visibility Graph
Liu, Y., & Li, G. (2022) · IEEE Access · doi:10.1109/access.2022.3187985 · Cited by 10
Murari, A., Rossi, R., & Gelfusa, M. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-022-10320-3 · Cited by 10
Chen, Z., Wang, Z., Yang, Y., & Gao, J. (2022) · Artificial Intelligence in Geosciences · doi:10.1016/j.aiig.2022.11.001 · Cited by 20
Weighted dynamic transfer network and spectral entropy for weak nonlinear time series detection
Zhang, H., Wang, H., Yan, Y., et al. (2023) · Nonlinear Dynamics · doi:10.1007/s11071-023-08310-3 · Cited by 10
Non-stationary neural signal to image conversion framework for image-based deep learning algorithms
Patel, S. A., & Yildirim, A. (2023) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2023.1081160 · Cited by 13
Unveiling the Connectivity of Complex Networks Using Ordinal Transition Methods
Almendral, J. A., Leyva, I., & Sendiña–Nadal, I. (2023) · Entropy · doi:10.3390/e25071079 · Cited by 10
Simplicial network analysis on EEG signals
Sudhamayee, K., Krishna, M. G., & Manimaran, P. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129230 · Cited by 10
He, Z., Zhang, S., Hu, J., & Dai, F. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129563 · Cited by 12
Time Series Analysis Based on Visibility Graph Theory
Yan, S., & Wang, D. (2015) · International Conference on Intelligent Human-Machine Systems and Cybernetics · doi:10.1109/ihmsc.2015.238 · Cited by 10
Horizontal visibility graphs from integer sequences
Lacasa, L. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/35/35lt01 · Cited by 10
Self-citationBhaduri, S., & Ghosh, D. C. (2017) · Acta Physica Polonica B · doi:10.5506/aphyspolb.48.741 · Cited by 10
On strongly connected networks with excitable-refractory dynamics and delayed coupling
Grindrod, P., & Lee, T. E. (2017) · Royal Society Open Science · doi:10.1098/rsos.160912 · Cited by 10
Bhaduri, A., Bhaduri, S., & Ghosh, D. C. (2017) · Physics of Particles and Nuclei Letters · doi:10.1134/s1547477117040033 · Cited by 10
Research on the co-movement between high-end talent and economic growth: A complex network approach
Zhang, Z., Wang, M., Xu, H., et al. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.11.049 · Cited by 10
Time irreversibility and intrinsics revealing of series with complex network approach
Xiong, H., Shang, P., Xia, J., et al. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.02.041 · Cited by 10
New irreversibility measure and complexity analysis based on singular value decomposition
Rong, L., & Shang, P. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.08.097 · Cited by 10
Reciprocal characterization from multivariate time series to multilayer complex networks
Zhao, Y., Peng, X., & SMALL, M. P. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5112799 · Cited by 10
Mapping coupled time-series onto a complex network
Ardalankia, J., Askari, J., Sheykhali, S., et al. (2020) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/132/58002 · Cited by 10
Persistent homology of fractional Gaussian noise
Masoomy, H., Askari, B., Najafi, M. N., & Movahed, M. S. (2021) · Physical review. E · doi:10.1103/physreve.104.034116 · Cited by 10
Visibility graph entropy based radiometric feature for physical layer identification
Zeng, S., Chen, Y., Li, X., et al. (2022) · Ad Hoc Networks · doi:10.1016/j.adhoc.2022.102780 · Cited by 10
Structural Properties and Complexity of a New Network Class: Collatz Step Graphs
Emmert‐Streib, F. (2013) · PLoS ONE · doi:10.1371/journal.pone.0056461 · Cited by 10
Quantile graphs for the characterization of chaotic dynamics in time series
Campanharo, A. S. L. O., & Ramos, F. M. (2015) · World Conference on Complex Systems · doi:10.1109/icocs.2015.7483302 · Cited by 10
Huang, Y., Cheng, W., Luo, S., et al. (2016) · PLoS ONE · doi:10.1371/journal.pone.0167198 · Cited by 10
Analysis of Spontaneous EEG Activity in Alzheimer’s Disease Using Weighted Visibility Graph
Cai, L., Deng, B., Wei, X., et al. (2018) · doi:10.1109/embc.2018.8513010 · Cited by 10
Huo, C., Ma, X., & Xin-Bao, N. (2017) · Acta Physica Sinica · doi:10.7498/aps.66.160502 · Cited by 10
Detection and recognition of LPI radar signals using visibility graphs
Tao, W., Kaili, J., Jingyi, L., et al. (2020) · Journal of Systems Engineering and Electronics · doi:10.23919/jsee.2020.000091 · Cited by 10
Entropy and Renormalization in Chaotic Visibility Graphs
Luque, B., Ballesteros, F., Robledo, A., et al. (2016) · doi:10.1002/9783527693245.ch1 · Cited by 10
Self-citationComplex networks theory and precursors of financial crashes
Soloviev, V., Solovieva, V., Tuliakova, A., Hostryk, A., & Pichl, L. (2020) · doi:10.31812/123456789/4119 · Cited by 10
A cross horizontal visibility graph algorithm to explore associations between two time series
Liu, J., Yu, Z., & Zhou, Y. (2024) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2024.114674 · Cited by 9
Zhang, L., Jian, X., & Ma, Y. (2024) · Frontiers in Physics · doi:10.3389/fphy.2024.1457287 · Cited by 9
Singh, S., Gupta, K. V., Pachori, R. B., Behera, L., & Bhushan, B. (2025) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2025.107684 · Cited by 9
The Multiscale Conformation Evolution of the Financial Time Series
Huang, S., An, H., Gao, X., et al. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/563145 · Cited by 9
Recent advances in bridging time series and complex networks
Li, X., Liu, X., & Tse, C. K. (2013) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2013.6572388 · Cited by 9
DYNAMICAL ANALYSES USING VISIBILITIES IN FINANCIAL MARKETS
Min, S., Lim, K., Chang, K.-H., et al. (2016) · Fractals · doi:10.1142/s0218348x1650016x · Cited by 9
Martı́n-Landrove, M., Torres-Hoyos, F., & Rueda-Toicen, A. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.122696 · Cited by 9
Classification of close binary stars using recurrence networks
George, S. V., Misra, R., & Ambika, G. (2019) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5120739 · Cited by 9
Analysis of attention on venture capital: A method of complex network on time series
Zhang, Y., Kou, M., Gao, T., et al. (2020) · International Journal of Modern Physics B · doi:10.1142/s0217979220502732 · Cited by 9
Rodríguez-Cortés, F. J., Jiménez‐Hornero, J. E., Alcala-Diaz, J. F., Jiménez-Hornero, F. J., Romero‐Cabrera, J. L., Cappadona, R., Manfredini, R., & López‐Soto, P. J. (2022) · Angiology · doi:10.1177/00033197221124779 · Cited by 8
Decoding EEG Signals with Visibility Graphs to Predict Varying Levels of Mental Workload
Teymourlouei, A., Gentili, R. J., & Reggia, J. A. (2023) · Conference on Information Sciences and Systems · doi:10.1109/ciss56502.2023.10089662 · Cited by 9
马, L. 璐. M., 任, Y.-L. 彦. R., He, A., et al. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acdfbf · Cited by 9
Visibility graph analysis of the sea surface temperature irreversibility during El Niño events
Zhao, D., Yang, X., Song, W., Zhang, W., & Huang, D. (2023) · Nonlinear Dynamics · doi:10.1007/s11071-023-08762-7 · Cited by 10
Computational Model of Functional Connectivity Distance Predicts Neural Alterations
Wadhera, T., & Mahmud, M. (2023) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2023.3320243 · Cited by 9
Degree distributions and motif profiles of Thue–Morse complex network
Hu, X., & Niu, M. (2023) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2023.114141 · Cited by 9
Exploring the Entropy-Based Classification of Time Series Using Visibility Graphs from Chaotic Maps
Conejero, J. A., Velichko, A., Garibo‐i‐Orts, Ò., Izotov, Y., & Pham, V. (2024) · Mathematics · doi:10.3390/math12070938 · Cited by 10
Predicting the Failure of Component X in the Scania Dataset with Graph Neural Networks
Parton, M., Fois, A., Vegliò, M., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58553-1_20 · Cited by 9
Visibility Graph-Based Wireless Anomaly Detection for Digital Twin Edge Networks
Bertalanič, B., Hribar, J., & Fortuna, C. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3393853 · Cited by 9
Xu, G., Wang, B., Liu, P., et al. (2024) · Physics of Fluids · doi:10.1063/5.0246774 · Cited by 9
Gao, Z., & Jin, N. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.11.002 · Cited by 9
Dynamical Systems Induced on Networks Constructed from Time Series
Hou, L., SMALL, M. P., & Lao, S. (2015) · Entropy · doi:10.3390/e17096433 · Cited by 9
An improved simulated annealing genetic algorithm of EEG feature selection in sleep stage
Ji, Y., Bu, X., Sun, J., et al. (2016) · Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC) · doi:10.1109/apsipa.2016.7820683 · Cited by 9
Analysis of Chinese Stock Market by Using the Method of Visibility Graph
Liu, F., Wang, N., & Wei, D. (2017) · The Open Cybernetics & Systemics Journal · doi:10.2174/1874110x01711010036 · Cited by 9
Unveiling non-stationary coupling between Amazon and ocean during recent extreme events
Ramos, A. M. T., Zou, Y., de Oliveira, G. S., Kurths, J., & Macau, E. E. N. (2017) · Climate Dynamics · doi:10.1007/s00382-017-3640-y · Cited by 9
A Visibility Graph Approach to CNY Exchange Rate Networks and Characteristic Analysis
Yao, C.-Z., & Lin, J.-N. (2017) · Discrete Dynamics in Nature and Society · doi:10.1155/2017/5632374 · Cited by 9
Fang, W., Gao, X., Huang, S., et al. (2018) · Open Physics · doi:10.1515/phys-2018-0047 · Cited by 9
Rong, L., & Shang, P. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4448-y · Cited by 9
Craciunescu, T., Murari, A., & Gelfusa, M. (2018) · Entropy · doi:10.3390/e20110891 · Cited by 9
Analysis of oil prices’ interaction in the USA based on complex networks
Zhen, Z., Tian, L., & Lu, J. (2019) · Energy Sources Part B Economics Planning and Policy · doi:10.1080/15567249.2019.1587796 · Cited by 9
Power-Law Distribution of Natural Visibility Graphs from Reaction Times Series
Mira‐Iglesias, A., Navarro‐Pardo, E., & Conejero, J. A. (2019) · Symmetry · doi:10.3390/sym11040563 · Cited by 8
Visibility graphs of fractional Wu–Baleanu time series
Conejero, J. A., Lizama, C., Mira‐Iglesias, A., et al. (2019) · The Journal of Difference Equations and Applications · doi:10.1080/10236198.2019.1619714 · Cited by 9
Lloyd, D. E. (2020) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2019.00098 · Cited by 10
Pérez-Oregon, J., Lovallo, M., & Telesca, L. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0007480 · Cited by 9
Econophysics of cryptocurrency crashes: an overview
Бєлінський, А. О., Serdyuk, O. A., Semerikov, S. O., & Soloviev, V. (2021) · SHS Web of Conferences · doi:10.1051/shsconf/202110703001 · Cited by 9
Complex Network for Solar Protons and Correlations With Flares
Mohammadi, Z., Alipour, N., Safari, H., et al. (2021) · Journal of Geophysical Research Space Physics · doi:10.1029/2020ja028868 · Cited by 9
Effects of noise correlation and imperfect data sampling on indicators of critical slowing down
Kaur, T., & Dutta, P. S. (2022) · Theoretical Ecology · doi:10.1007/s12080-022-00532-2 · Cited by 9
Topological similarity of time-dependent objects
Nie, C.-X. (2022) · Nonlinear Dynamics · doi:10.1007/s11071-022-07862-0 · Cited by 9
On the Analysis and Classification of Sleep Stages from Cardiorespiratory Activity
Long, X., & Long, X. (2015) · Cited by 8
Metadata
- Authors
- Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C.
- Affiliations
- Universidad Politécnica de Madrid (ES)
- Universitat de València (ES)
- Universitat Politècnica de Catalunya (ES)
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2008-04
- Volume
- 105
- Issue
- 13
- Pages
- 4972-4975
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC2278201
- OpenAlex
- W2055538060
- Semantic Scholar
- a0c1483e0e34fb9bc1baf929ce892f111e329fa6
- Cited by
- 1,826
- References
- 22
- Citations by year
- 2026: 102 · 2025: 180 · 2024: 149 · 2023: 156 · 2022: 157 · 2021: 151 · 2020: 157 · 2019: 154 · 2018: 137 · 2017: 105 · 2016: 84 · 2015: 60 · 2014: 61 · 2013: 47 · 2012: 51
- FWCI
- 56.61
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- PubMed Central (submittedVersion)
- arXiv (Cornell University)
- Topics
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
- Keywords
- visibility graph, time series, complex networks, scale-free networks, power-law degree distribution, fractality, regular graphs, random graphs, network metrics, time series characterization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
