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 501–600 of 1,826
A combinatorial framework to quantify peak/pit asymmetries in complex dynamics
Hasson, U., Iacovacci, J., Davis, B., et al. (2018) · Scientific Reports · doi:10.1038/s41598-018-21785-0 · Cited by 17
Self-citationLiu, H., Zhang, X., Zhang, X., et al. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.02.030 · Cited by 17
Physical Layer Authentication Based on CFO and Visibility Graph
Zeng, S., Li, X., Salem, A., et al. (2018) · International Conference on Networking and Network Applications (NaNA) · doi:10.1109/nana.2018.8648709 · Cited by 17
Extracting Correlations in Earthquake Time Series Using Visibility Graph Analysis
Kundu, S., Opris, A., Yukutake, Y., et al. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.656310 · Cited by 17
Photoplethysmography-Based Blood Pressure Estimation Using Deep Learning
Wang, W., Zhu, L., Marefat, F., Mohseni, P., Kilgore, K. L., & Najafizadeh, L. (2020) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf51394.2020.9443447 · Cited by 18
Characterizing ordinal network of time series based on complexity-entropy curve
Peng, K., & Shang, P. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2021.108464 · Cited by 17
Graft: A graph based time series data mining framework
Mishra, K., Basu, S., & Maulik, U. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104695 · Cited by 17
Complex Network Analysis of Recurrences
Donner, R. V., Donges, J. F., Zou, Y., et al. (2014) · Understanding complex systems · doi:10.1007/978-3-319-07155-8_4 · Cited by 17
Approximate entropy of network parameters
West, J., Lacasa, L., Simone Severini, B., et al. (2012) · Physical Review E · doi:10.1103/physreve.85.046111 · Cited by 17
Self-citationHayashi, K., Gotoda, H., & Gentili, P. L. (2016) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4948590 · Cited by 17
Coupled Time Series Analysis: Methods and Applications
Jafari, G., Shirazi, A. H., Namaki, A., et al. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.102 · Cited by 17
Studying complex tourism systems: a novel approach based on networks derived from a time seriesPreprint
Baggio, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.5909 · Cited by 17
Graph-Based Time Series Edge Anomaly Detection in Smart Grid
Xu, A., Wu, T., Zhang, Y., et al. (2021) · IEEE International Conference on Big Data Security on Cloud, IEEE International Conference on High Performance and Smart Computing, and IEEE International Conference on Intelligent Data and Security (BigDataSecurity/HPSC/IDS) · doi:10.1109/bigdatasecurityhpscids52275.2021.00012 · Cited by 16
Time Labeled Visibility Graph for Privacy-Preserved Physiological Time Series Classification
Xiu, Y., Ren, X., Zhang, T., Chen, Y., Li, J., Li, D., Wang, X., Zhao, L., & Chan, W. K. V. (2022) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda55098.2022.9778887 · Cited by 16
Can Deep Learning distinguish chaos from noise? Numerical experiments and general considerations
Zanin, M. (2022) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2022.106708 · Cited by 18
Time series clustering based on complex network with synchronous matching states
Li, H., Liu, Z., & Wan, X. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.118543 · Cited by 16
Wadhera, T., & Mahmud, M. (2022) · Brain informatics and health · doi:10.1007/978-981-19-5272-2_6 · Cited by 16
Review of graph construction and graph learning in stock price prediction
Wang, Y., Qu, Y., & Chen, Z. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2022.11.240 · Cited by 17
Evolving patterns of agricultural production space in China: A network-based approach
Yang, S., Li, Z., Zhou, J., Gao, Y., & Cui, X. (2023) · Geography and sustainability · doi:10.1016/j.geosus.2023.11.007 · Cited by 17
Multi-state ship traffic flow analysis using data-driven method and visibility graph
Sui, Z., Wang, S., Wen, Y., et al. (2024) · Ocean Engineering · doi:10.1016/j.oceaneng.2024.117087 · Cited by 16
Spatio-Temporal Dynamic Graph Attention Network-Based Detector for Sea-Surface Small Targets
Xu, S., & He, Q. (2024) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2024.3421908 · Cited by 18
Li, Z., Chen, Z., Wei, X., Gao, S. B., Yue, H., Xu, Z., & Quek, T. Q. S. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2024.3449129 · Cited by 18
Generalized Statistical Mechanics at the Onset of Chaos
Robledo, A. (2013) · Entropy · doi:10.3390/e15125178 · Cited by 16
A Random Walk on Image Patches
Taylor, K. M., & Meyer, F. G. (2012) · SIAM Journal on Imaging Sciences · doi:10.1137/110839370 · Cited by 15
Horizontal Visibility graphs generated by type-II intermittency
Núñez, Á. M., Lacasa, L., & Gómez, J. P. (2013) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/3/035102 · Cited by 16
Self-citationZou, Y., Donner, R. V., Marco Thiel, A., et al. (2016) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4942584 · Cited by 16
Chen, S., Gallagher, M. J., Hogg, F. R. A., et al. (2018) · Journal of Neurotrauma · doi:10.1089/neu.2018.5775 · Cited by 16
Information Linkage between Carbon and Energy Markets: Multiplex Recurrence Network Approach
Xu, H., Wang, M., & Yang, W. (2020) · Complexity · doi:10.1155/2020/5841609 · Cited by 17
Multilayer limited penetrable visibility graph for characterizing the gas-liquid flow behavior
Gao, Z., Liu, M., Dang, W., et al. (2020) · Chemical Engineering Journal · doi:10.1016/j.cej.2020.127229 · Cited by 16
Visibility network analysis of large-scale intermittency in convective surface layer turbulence
Chowdhuri, S., Iacobello, G., & Banerjee, T. (2021) · Journal of Fluid Mechanics · doi:10.1017/jfm.2021.720 · Cited by 16
Learning to Rank for Multi-Step Ahead Time-Series Forecasting
Duan, J., & Kashima, H. (2021) · IEEE Access · doi:10.1109/access.2021.3068895 · Cited by 16
Investigation of stock price network based on time series analysis and complex network
Cui, X., Hu, J., Ma, Y., et al. (2021) · International Journal of Modern Physics B · doi:10.1142/s021797922150171x · Cited by 16
Weighted multi-scale limited penetrable visibility graph for exploring atrial fibrillation rhythm
Li, W., Wang, H., Zhuang, L., et al. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108288 · Cited by 16
Hu, Y., & Xiao, F. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.112243 · Cited by 16
Recurrence Network Analysis of the Synchronous EEG Time Series in Normal and Epileptic Brains
Peng, L., Liu, D.-B., Cai, S., et al. (2012) · Cell Biochemistry and Biophysics · doi:10.1007/s12013-012-9452-0 · Cited by 16
Scaling analysis of phase fluctuations in experimental three-phase flows
Gao, Z., & Jin, N. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.04.024 · Cited by 16
A New Probability Transformation Based on the Ordered Visibility Graph
Li, M., Zhang, Q., & Deng, Y. (2015) · International Journal of Intelligent Systems · doi:10.1002/int.21744 · Cited by 16
Nonequilibrium physics of brain dynamics
Nartallo-Kaluarachchi, R., Kringelbach, M. L., Deco, G., Lambiotte, R., & Goriely, A. (2025) · Physics Reports · doi:10.1016/j.physrep.2025.10.003 · Cited by 23
Lu, Y., Zhang, S., Liu, C., Zhang, R., Ai, B., Niyato, D. T., Ni, W., Wang, X., & Jamalipour, A. (2026) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2026.3651990 · Cited by 28
Partial Discharge Detection Framework Employing Spectral Analysis of Horizontal Visibility Graph
Roy, S. S., & Chatterjee, S. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.3028849 · Cited by 15
Neural ODE to model and prognose thermoacoustic instability
Dhadphale, J. M., Unni, V. R., Saha, A., & Sujith, R. I. (2022) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0064215 · Cited by 15
An Efficient Sleep Scoring Method using Visibility Graph and Temporal Features of Single-Channel EEG
Jain, R., & Ramakrishnan, A. G. (2021) · Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society · doi:10.1109/embc46164.2021.9630863 · Cited by 15
Origins of scaling laws in microbial dynamics
Wang, X., & Liu, Y. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013004 · Cited by 15
Path-Based Visibility Graph Kernel and Application for the Borsa Istanbul Stock Network
Akgüller, Ö., Balcı, M. A., Batrancea, L. M., et al. (2023) · Mathematics · doi:10.3390/math11061528 · Cited by 15
A graph-based cardiac arrhythmia classification methodology using one-lead ECG recordings
EPMoghaddam, D., Muguli, A., Razavi, M., et al. (2024) · Intelligent Systems with Applications · doi:10.1016/j.iswa.2024.200385 · Cited by 15
Forecasting Financial Extremes: A Network Degree Measure of Super-Exponential Growth
Yan, W., & van Serooskerken, E. V. T. (2015) · PLoS ONE · doi:10.1371/journal.pone.0128908 · Cited by 15
Temporal pattern in Corinth rift seismicity revealed by visibility graph analysis
Hloupis, G. (2017) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2017.03.015 · Cited by 15
Reconstructing multi-mode networks from multivariate time series
Gao, Z., Yang, Y., Dang, W., et al. (2017) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/119/50008 · Cited by 15
On system behaviour using complex networks of a compression algorithm
Walker, D. M., Corrêa, D., & SMALL, M. P. (2018) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5001955 · Cited by 15
Visibility in the topology of complex networks
Tsiotas, D., & Charakopoulos, A. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.03.055 · Cited by 15
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0010 · Cited by 15
Gao, Z., Feng, Y., Ma, C., Ma, K., Cai, Q., & Initiative, A. F. T. A. D. N. (2020) · Current Alzheimer Research · doi:10.2174/1567205017666200213100607 · Cited by 15
Solar Flare Modified Complex Network
Najafi, A., Darooneh, A. H., Gheibi, A., et al. (2020) · The Astrophysical Journal · doi:10.3847/1538-4357/ab8301 · Cited by 15
On fractality of functional near-infrared spectroscopy signals: analysis and applications
Zhu, L., Haghani, S., & Najafizadeh, L. (2020) · Neurophotonics · doi:10.1117/1.nph.7.2.025001 · Cited by 16
Augmenting Neuromuscular Disease Detection Using Optimally Parameterized Weighted Visibility Graph
Bose, R., Samanta, K., Modak, S., et al. (2020) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2020.3001877 · Cited by 15
Complex Network Aided Partial Discharge Signal Recognition Framework Employing Visibility Graph
Roy, S. S., & Chatterjee, S. (2020) · IEEE Sensors Letters · doi:10.1109/lsens.2020.3014251 · Cited by 15
Qiao, H.-H., Deng, Z.-H., Li, H.-J., Hu, J., Song, Q., & Gao, L. (2021) · Neurocomputing · doi:10.1016/j.neucom.2020.07.125 · Cited by 12
Li, S., & Shang, P. (2021) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2021.110687 · Cited by 15
Pérez, S. I., & Criado, R. (2022) · Mathematics · doi:10.3390/math11010107 · Cited by 16
Econophysics of cryptocurrency crashes: a systematic review
Бєлінський, А. О., Serdyuk, O. A., Semerikov, S. O., Соловйов, В. М., Білінський, А. І., & Сердюк, О. А. (2021) · doi:10.31812/123456789/6974 · Cited by 15
Disrupted small-world brain network in children with Down Syndrome
Ahmadlou, M., Gharib, M., Hemmati, S., Vameghi, R., & Sajedi, F. (2013) · Clinical Neurophysiology · doi:10.1016/j.clinph.2013.03.004 · Cited by 15
A comparison of two methods for modeling large-scale data from time series as complex networks
Li, Y., Caö, H., & Tan, Y. (2011) · AIP Advances · doi:10.1063/1.3556121 · Cited by 15
Unraveling chaotic attractors by complex networks and measurements of stock market complexity
Caö, H., & Li, Y. (2014) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4868258 · Cited by 15
Linear and nonlinear analysis of brain dynamics in children with cerebral palsy
Sajedi, F., Ahmadlou, M., Vameghi, R., Gharib, M., & Hemmati, S. (2013) · Research in Developmental Disabilities · doi:10.1016/j.ridd.2013.01.016 · Cited by 15
Gao, Z., Hu, L.-D., & Jin, N. (2013) · Chinese Physics B · doi:10.1088/1674-1056/22/5/050507 · Cited by 15
Dynamical states, possibilities and propagation of stress signal
Malik, M. Z., Ali, S., Singh, S. S., Ishrat, R., & Singh, R. K. B. (2017) · Scientific Reports · doi:10.1038/srep40596 · Cited by 15
Degree distributions and motif profiles of limited penetrable horizontal visibility graphs
Wang, M., Xu, H., Tian, L., et al. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.06.077 · Cited by 15
John, R., & John, M. (2019) · Advances in Water Resources · doi:10.1016/j.advwatres.2019.103429 · Cited by 15
Generalized Statistical Mechanics at the Onset of ChaosPreprint
Robledo, A. (2016) · Cited by 15
Using complex networks towards information retrieval and diagnostics in multidimensional imagingPreprint
Banerjee, S. J., Azharuddin, M., Sen, D., et al. (2015) · arXiv (Cornell University) · doi:10.1038/srep17271 · Cited by 14
Enhanced visibility graph for EEG classification
Belhadi, A., Lind, P. G., Djenouri, Y., & Yazidi, A. (2025) · Frontiers in Neuroscience · doi:10.3389/fnins.2025.1541062 · Cited by 19
Relation between the degree and betweenness centrality distribution in complex networks
Masoomy, H., Adami, V., & Najafi, M. N. (2023) · Physical review. E · doi:10.1103/physreve.107.044303 · Cited by 14
Visibility graph-based segmentation of multivariate time series data and its application
Hu, J., Chu, C., Zhu, P., et al. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0152881 · Cited by 14
Graph Receptive Transformer Encoder for Text Classification
Aras, A. C., Alikaşifoğlu, T., & Koç, A. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3380362 · Cited by 14
Yao, L., Lu, Y. H., Wang, M., Qian, Y., & Li, H. (2024) · Applied Sciences · doi:10.3390/app14062636 · Cited by 14
The general conformable fractional grey system model and its applications
Xie, W., Wu, W.-Z., Liu, C., et al. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.108817 · Cited by 14
Word-Length Correlations and Memory in Large Texts: A Visibility Network Analysis
Guzmán-Vargas, L., Obregón-Quintana, B., Aguilar-Velázquez, D., et al. (2015) · Entropy · doi:10.3390/e17117798 · Cited by 14
Multifractal analysis of visibility graph-based Ito-related connectivity time series
Czechowski, Z., Lovallo, M., & Telesca, L. (2016) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4942582 · Cited by 14
Intrinsic multiplex graph model detects incipient process drift in ultraprecision manufacturing
Shamsan, A., & Cheng, C. (2018) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2018.12.005 · Cited by 14
Liu, S., Fang, W., Gao, X., et al. (2019) · Energy · doi:10.1016/j.energy.2019.06.072 · Cited by 14
Peng, X., Zhao, Y., & SMALL, M. P. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.125108 · Cited by 14
Data-Driven Analysis of the Chaotic Characteristics of Air Traffic Flow
Zhang, Z., Zhang, A., Sun, C., et al. (2020) · Journal of Advanced Transportation · doi:10.1155/2020/8830731 · Cited by 14
Zhang, D., Long, X., Xu, L., Werth, J., Wijshoff, R. W. C. G. R., Aarts, R. M., & Andriessen, P. (2021) · Journal of Applied Physiology · doi:10.1152/japplphysiol.00333.2020 · Cited by 15
Cai, Q., An, J., & Gao, Z. (2020) · Brain Science Advances · doi:10.26599/bsa.2020.9050016 · Cited by 14
Complex network analysis of the gravity effect on premixed flames propagating in a Hele-Shaw cell
Nomi, Y., Gotoda, H., Kandani, S., et al. (2021) · Physical review. E · doi:10.1103/physreve.103.022218 · Cited by 14
A multi-scale transition matrix approach to chaotic time series
Yuan, Q., Zhang, J., Wang, H., et al. (2023) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2023.113589 · Cited by 14
Assessment of Similarity Between Well Logs Using Synchronization Measures
Verma, A. K., Routray, A., & Mohanty, W. K. (2014) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2014.2317498 · Cited by 14
Bhaduri, S., & Chakraborty, A. (2016) · Journal of Neurology and Neuroscience · doi:10.21767/2171-6625.1000100 · Cited by 14
Analysis and Prediction of Epilepsy Based on Visibility Graph
Hao, C., Chen, Z., & Zhao, Z. (2016) · International Conference on Information Science and Control Engineering · doi:10.1109/icisce.2016.272 · Cited by 14
Surface morphology of ballistic deposition with patchy particles and visibility graph
Kartha, M. J. (2016) · Physics Letters A · doi:10.1016/j.physleta.2016.12.020 · Cited by 14
Scale-free networks emerging from multifractal time series
Budroni, M. A., Baronchelli, A., & Pastor‐Satorras, R. (2017) · Physical review. E · doi:10.1103/physreve.95.052311 · Cited by 14
Liu, S., Gao, X., Fang, W., et al. (2018) · IEEE Access · doi:10.1109/access.2018.2842069 · Cited by 14
Nonlinear dynamics of river runoff elucidated by horizontal visibility graphs
Lange, H., Sippel, S., & Rosso, O. A. (2018) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5026491 · Cited by 14
Identification of Dynamical Behavior of Pseudoperiodic Time Series by Network Community Structure
Han, X., Zhao, Y., & SMALL, M. P. (2019) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2019.2903936 · Cited by 14
Network correlation between investor’s herding behavior and overconfidence behavior*
Zhang, M., & Wang, Y. (2020) · Chinese Physics B · doi:10.1088/1674-1056/ab7740 · Cited by 14
Pattern interdependent network of cross-correlation in multivariate time series
Ren, H., Yuan, Q., Semba, S., et al. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126781 · Cited by 14
Wang, M., Wu, F., & Chen, J. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.755932 · Cited by 14
Wang, F., Meng, Q., Chen, Y., et al. (2014) · Cited by 13
Fast and Sample Accurate R-Peak Detection for Noisy ECG Using Visibility Graphs
Koka, T., & Muma, M. (2022) · Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society · doi:10.1109/embc48229.2022.9871266 · Cited by 13
Characterizing the Solar Activity Using the Visibility Graph Method
Zurita-Valencia, T., & Muñoz, V. (2023) · Entropy · doi:10.3390/e25020342 · Cited by 13
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
