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 1,101–1,200 of 1,826
Bohnsack, K. S., Kaden, M., Voigt, J., et al. (2022) · doi:10.14428/esann/2022.es2022-36 · Cited by 4
Xie, J., Gao, J., Gao, Z., et al. (2017) · Science China Technological Sciences · doi:10.1007/s11431-017-9138-3 · Cited by 4
Specific emitter identification based on horizontal visibility graph
Zhu, S., & Gan, L. (2017) · IEEE International Conference on Computer and Communications (ICCC) · doi:10.1109/compcomm.2017.8322758 · Cited by 4
Advancing Through TerrainsPreprint
Froese, V., & Renken, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.08746 · Cited by 4
Nartallo-Kaluarachchi, R., Bonetti, L., Fernández‐Rubio, G., Vuust, P., Deco, G., Kringelbach, M. L., Lambiotte, R., & Goriely, A. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.05.02.592195 · Cited by 4
Guo, C., Wang, J., Zhang, Y., et al. (2024) · PLoS ONE · doi:10.1371/journal.pone.0291460 · Cited by 3
Chen, M., Tang, L., Yang, X., et al. (2024) · IEEE Sensors Journal · doi:10.1109/jsen.2024.3442239 · Cited by 3
Ordinal pattern-based analysis of an opposition-controlled turbulent channel flow
Iseki, R., Gotoda, H., & Nabae, Y. (2024) · Journal of Fluid Mechanics · doi:10.1017/jfm.2024.986 · Cited by 3
Directed recurrence networks for the analysis of nonlinear and complex dynamical systems
Delage, R., & Nakata, T. (2025) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0235311 · Cited by 3
Chen, G., Li, K., Yuan, K., et al. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.110988 · Cited by 3
Li, Y., Chen, Z., Wu, Y., et al. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.117035 · Cited by 3
Chen, T., Ren, X., Lai, J., Tan, H., Liu, F., & Chan, W. K. V. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114389 · Cited by 3
Disentangling metabolic and neurovascular timescales supporting cognitive processes
Saviola, F., Tambalo, S., Beghini, L., Ferrari, A., Cassone, B., Ville, D. V. D., & Jovicich, J. (2025) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2506513122 · Cited by 3
Kanca, A. M., & Türker, İ. (2025) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70389 · Cited by 3
Şimşek, O., ZEYBEKOĞLU, U., Plocoste, T., et al. (2026) · Stochastic Environmental Research and Risk Assessment · doi:10.1007/s00477-026-03176-4 · Cited by 3
Can graph reveal optical absorption? – Interrogation through thermal lensing
Sankararaman, S. I. (2021) · Optik · doi:10.1016/j.ijleo.2021.168176 · Cited by 3
Natural and Artificial Dynamics in Graphs: Concept, Progress, and Future
Fu, D., & He, J. (2022) · Frontiers in Big Data · doi:10.3389/fdata.2022.1062637 · Cited by 4
Visibility Graph-based Cache Management for DRAM Buffer Inside Solid-state Drives
Sha, Z., Li, J., Zhang, F., et al. (2023) · ACM Transactions on Storage · doi:10.1145/3586576 · Cited by 3
Kosmidis, K., & Hütt, M. ‐. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129043 · Cited by 3
Visibility graphs of critical and off-critical time series for absorbing state phase transitions
Moraes, J. T., & Ferreira, S. C. (2023) · Physical review. E · doi:10.1103/physreve.108.044309 · Cited by 3
Bridge successive states for a complex system with evolutionary matrix
Yan, S., Gu, C., & Yang, H. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129534 · Cited by 3
Li, S., Sun, D., Wang, C., et al. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3487895 · Cited by 3
Yan, H., Chen, Z., Zhu, F., & Zheng, W. (2024) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2024.107295 · Cited by 3
Functional Connectivity Methods for Multi-Class Mental Workload Classification
Teymourlouei, A., Hu, M., Gentili, R. J., et al. (2024) · doi:10.1109/embc53108.2024.10782848 · Cited by 3
The advantages of k-visibility: A comparative analysis of several time series clustering algorithms
Pérez, S. I., Partida, A., & Criado, R. (2024) · AIMS Mathematics · doi:10.3934/math.20241687 · Cited by 3
Analysis of Aftershocks from California and Synthetic Series by Using Visibility Graph Algorithm
Muñoz-Diosdado, A., Aguilar-Molina, A. M., Solis-Montufar, E. E., et al. (2025) · Entropy · doi:10.3390/e27020178 · Cited by 3
Analysis of Annual Drought Episodes Using Complex Networks
Spiliotis, K., Voudouris, K. S., Vangelis, H., et al. (2025) · Sustainability · doi:10.3390/su17041441 · Cited by 3
Tandon, S., Balaji, A., Radhakrishnan, R., et al. (2025) · Journal of Fluid Mechanics · doi:10.1017/jfm.2024.1235 · Cited by 3
A generalized high-order correlation dimension for strange attractors
Weng, T., Wu, M., Feng, S., et al. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.116190 · Cited by 3
Time series analysis of wildfire propagation in Chile: A complex networks approach
Gallo-Méndez, I., Clark, J., & Pastén, D. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.116347 · Cited by 4
Geng, B., Shen, X., Yan, Y., et al. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-025-11153-9 · Cited by 3
Yuan, B., Liu, J., Yu, Z., et al. (2025) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2025.108831 · Cited by 3
Huang, J. M., Liu, X., Li, Y., et al. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.116487 · Cited by 3
Yi, G., Song, J., Zhang, W., et al. (2025) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2025.108178 · Cited by 3
Júnior, L. R. D. F., & Guimarães, F. G. (2025) · Journal of Electrical Engineering and Technology · doi:10.1007/s42835-025-02293-4 · Cited by 3
A novel forecasting method for time series based on vector visibility graphs
Pan, Y., Hu, W., Ge, X., et al. (2025) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2025.130839 · Cited by 3
Visibility to discern local from nonlocal dynamic processes
Brú, A., Gómez‐Castro, D., & Nuño, J. C. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.12.078 · Cited by 3
Self-citationThe detection of local irreversibility in time series based on segmentation
Teng, Y., & Shang, P. (2017) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2017.10.016 · Cited by 3
Telesca, L., Kadirov, F. A., Yetirmishli, G. J., et al. (2018) · Pure and Applied Geophysics · doi:10.1007/s00024-018-1945-3 · Cited by 3
Bhaduri, S., Bhaduri, A., & Ghosh, D. C. (2018) · Pramana · doi:10.1007/s12043-018-1664-4 · Cited by 5
Gómez-Hernández, D., García-Gudiño, D., Landa, E., et al. (2019) · PLoS ONE · doi:10.1371/journal.pone.0221674 · Cited by 3
Spatio-temporal summarized visualization of smartX multi-view visibility in cloud-native edge boxes
Rathore, M., & Kim, J. (2020) · Computer Science and Information Systems · doi:10.2298/csis200317034r · Cited by 3
Gao, Z., Jin, N., Yang, D., et al. (2012) · Acta Physica Sinica · doi:10.7498/aps.61.120510 · Cited by 3
Detecting causal relations in time series with the new cross Markov Matrix technique
Craciunescu, T., & Murari, A. (2021) · Nonlinear Dynamics · doi:10.1007/s11071-020-06179-0 · Cited by 3
The volatility in financial time series based on granule complex network
Xueyi, L., & Luo, C. (2021) · International Journal of Modern Physics C · doi:10.1142/s0129183121501163 · Cited by 3
Temporal Vector Visibility Graph: A Tool for Complexity Analysis of Multivariate Time Series
Shang, B., & Shang, P. (2022) · Fluctuation and Noise Letters · doi:10.1142/s0219477522500444 · Cited by 3
Analysis of Patent Application Attention: A Network Analysis Method
Mao, S., Hu, Y., Yuan, X., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.893348 · Cited by 3
Wang, Z., Shang, P., & Mao, X. (2022) · Nonlinear Dynamics · doi:10.1007/s11071-022-07991-6 · Cited by 3
马, L. 璐. M., 陈, M. 梅. C., He, A., et al. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acb422 · Cited by 3
Complexity parameters of solar-wind magnetic fluctuations at 1 AU during SC23 and SC24
Acosta, B., Pastén, D., & Moya, P. S. (2023) · Astronomy and Astrophysics · doi:10.1051/0004-6361/202245265 · Cited by 3
Wang, T., Guo, H., Ge, Z., et al. (2023) · EURASIP Journal on Audio Speech and Music Processing · doi:10.1186/s13636-023-00272-z · Cited by 3
Paranjape, P. N., Dhabu, M. M., & Deshpande, P. S. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-28183-9_2 · Cited by 3
TheK−MSlope: A Potential Supplement forb-Value
Li, L., Luo, G., & Liu, M. (2023) · Seismological Research Letters · doi:10.1785/0220220268 · Cited by 3
Yin, Y., Wang, X., Wang, W., et al. (2023) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2023.107308 · Cited by 3
Mari, C., & Baldassari, C. (2023) · Computational Management Science · doi:10.1007/s10287-023-00460-4 · Cited by 3
A data-driven framework for learning hybrid dynamical systems
Li, Y., Xu, S., Duan, J., et al. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0157669 · Cited by 3
Fault Diagnosis for Rolling Bearings Based on Novel Visibility Graph and GCN Scheme
Gao, S., Li, Y., & Zhao, D. (2023) · IEEE Data Driven Control and Learning Systems Conference (DDCLS) · doi:10.1109/ddcls58216.2023.10166508 · Cited by 3
Learning Visibility Attention Graph Representation for Time Series Forecasting
Mao, S., & Zeng, X. (2023) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3583780.3615289 · Cited by 3
Delage, R., & Nakata, T. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0173394 · Cited by 3
A Novel Directed Graph Convolutional Neural Network for Rolling Bearings in Fault Diagnosis
Gao, S., Li, Y., & Zhao, D. (2023) · IEEE International Conference on Unmanned Systems (ICUS) · doi:10.1109/icus58632.2023.10318286 · Cited by 3
Recovering network topology and dynamics from sequences: A machine learning approach
Guerreiro, L., Silva, F. N., & Amancio, D. R. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129618 · Cited by 3
Mathur, P., Kaistha, S., & Chakka, V. K. (2023) · IEEE India Conference · doi:10.1109/indicon59947.2023.10440952 · Cited by 3
Bursting-process modulation in a turbulent boundary layer via the natural visibility graph method
Shi, L., Wang, M., Tang, Z., et al. (2024) · Physics of Fluids · doi:10.1063/5.0196857 · Cited by 3
An approach to complex network analysis on pp collisions at LHC energies
Ahmed, A., Biswas, T., Subba, N., Paul, S., Tawfik, A. N., Kalam, M., Ghosh, D. C., & Haldar, P. K. (2024) · International Journal of Modern Physics E · doi:10.1142/s0218301324500228 · Cited by 3
Khan, Z., Manikandan, M. S., & Mahmud, M. (2024) · International Conference on Electronics, Computers and Artificial Intelligence (ECAI) · doi:10.1109/ecai61503.2024.10607569 · Cited by 3
Predicting Global Average Temperature Time Series Using an Entire Graph Node Training Approach
Wang, Z., Chen, Z., Shi, Z., & Gao, J. (2024) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2024.3480888 · Cited by 3
Visibility Graph Investigation of the Shallow Seismicity of Lai Chau Area (Vietnam)
Telesca, L., Thai, A. T., Cao, D. T., et al. (2024) · Entropy · doi:10.3390/e26110932 · Cited by 3
Saryazdi, A. R., Nazarimehr, F., Ghassemi, F., Parastesh, F., & Jafari, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad8a9d · Cited by 3
A tactile recognition method for rice plant lodging based on adaptive decision boundary
Chen, X., Dang, P., Chen, Y., & Qi, L. (2025) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2024.109890 · Cited by 3
Spatial Semantic Expression of Terrain Viewshed: A Data Mining Method
Zhang, C., Wang, Y., Cheng, H., et al. (2025) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi14030113 · Cited by 3
Silva, F., Orang, O., Erazo-Costa, F. J., Silva, P. C. D. L. E., Barros, P. H., Ferreira, R. P. M., & Guimarães, F. G. (2025) · IEEE Access · doi:10.1109/access.2025.3554097 · Cited by 3
Topological data analysis of the visibility graphs of the BTW avalanche-size sequences
Adami, V., Masoomy, H., & Najafi, M. N. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/add4d4 · Cited by 3
Scalar embedding of temporal network trajectories
Lacasa, L., Marín-Rodríguez, F. J., Masuda, N., & Arola-Fernández, L. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.116599 · Cited by 3
Self-citationPei, L., Liu, J., & Cai, Z. (2025) · Infrared Physics & Technology · doi:10.1016/j.infrared.2025.105938 · Cited by 3
Image Converting into Complex Networks : Scale- Level Segmentation Approach
Trufanov, A. I., Kinash, N., Берестнева, О. Г., et al. (2017) · doi:10.2991/itsmssm-17.2017.88 · Cited by 3
Bhaduri, S., Bhaduri, A., & Ghosh, D. C. (2019) · Physics of Particles and Nuclei Letters · doi:10.1134/s1547477119060062 · Cited by 3
Locally Weighted Adjustable Parameter-Based LPVG in the Identification of Functional Regions
Li, L., Yang, Z., Nai, H., et al. (2019) · IEEE Access · doi:10.1109/access.2019.2929916 · Cited by 3
A novel solar irradiance forecast model using complex network analysis and classification modeling
Lv, K., Wang, F., Che, J., et al. (2019) · IEEE Innovative Smart Grid Technologies-Asia · doi:10.1109/isgt-asia.2019.8881584 · Cited by 3
Type-I intermittency from Markov binary block visibility graph perspective
Bordbar, P., & Ahadpour, S. (2020) · Journal of Applied Statistics · doi:10.1080/02664763.2020.1761949 · Cited by 3
Persistent Graphs and Cyclic Polytope Triangulations
Froese, V., & Renken, M. (2021) · COMBINATORICA · doi:10.1007/s00493-020-4369-5 · Cited by 3
Li, R., Huang, Y., Xie, F., et al. (2020) · Atmospheric and Oceanic Science Letters · doi:10.1016/j.aosl.2020.100008 · Cited by 3
The lack of reversibility during financial crisis and its identification
Бєлінський, А. О., Hushko, S. V., Matviychuk, A. V., et al. (2021) · SHS Web of Conferences · doi:10.1051/shsconf/202110703002 · Cited by 3
A Scalable Linear-Time Algorithm for Horizontal Visibility Graph Construction Over Long Sequences
Stephen, C. (2021) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata52589.2021.9671517 · Cited by 3
Tire Pressure Monitoring using Weighted Horizontal Visibility Graphs
Schmidt, J. (2022) · International Conference on Control, Automation and Diagnosis (ICCAD) · doi:10.1109/iccad55197.2022.9853892 · Cited by 3
Shang, B., & Shang, P. (2022) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2022.106904 · Cited by 3
The earthquake network: the best time scale for network construction
Lotfi, N. (2023) · Acta Geophysica · doi:10.1007/s11600-023-01134-0 · Cited by 3
Power-law accelerating growth complex networks with mixed attachment mechanisms
Chen, T., & Shao, Z.-G. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.050 · Cited by 3
Valous, N. A., Delgado, A. E., Drakakis, K. E., et al. (2014) · Journal of Applied Physics · doi:10.1063/1.4862641 · Cited by 3
Liu, J., Liu, H., Huang, Z., et al. (2015) · International Conference on Intelligent Control and Information Processing · doi:10.1109/icicip.2015.7388185 · Cited by 3
Li, H., An, H., Gao, X., et al. (2015) · Humanities and Social Sciences Communications · doi:10.1057/palcomms.2015.23 · Cited by 3
Study of Loss of Alertness and Driver Fatigue Using Visibility Graph Synchronization
Sengupta, A., Kar, S., & Routray, A. (2015) · Advances in computational intelligence and robotics book series · doi:10.4018/978-1-4666-8723-3.ch007 · Cited by 3
Clustering 1-dimensional periodic network using betweenness centrality
Fu, N., & Suppakitpaisarn, V. (2016) · Computational Social Networks · doi:10.1186/s40649-016-0031-1 · Cited by 3
Multiscale Fluctuation Features of the Dynamic Correlation between Bivariate Time Series
Jiang, M., Gao, X., An, H., et al. (2016) · Mathematical Problems in Engineering · doi:10.1155/2016/4742060 · Cited by 3
A novel weight determination method for time series data aggregation
Xu, P., Zhang, R., & Deng, Y. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.04.028 · Cited by 3
Secure communication scheme analysis via complex networks
Ding, Y., Xiong, N., He, E., et al. (2017) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.4282 · Cited by 3
Correlation networks from random walk time series
Pal, H., Seligman, T. H., & Escobar, J. V. (2018) · Physical review. E · doi:10.1103/physreve.98.032311 · Cited by 3
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0005 · Cited by 3
Wang, C., Zhang, Z., & Zhu, M. H. (2018) · IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C) · doi:10.1109/qrs-c.2018.00079 · Cited by 3
Epileptic Seizure Prediction Using Weighted Visibility Graph
Rajadurai, T. E., & Valliyammai, C. (2018) · Communications in computer and information science · doi:10.1007/978-981-13-1936-5_48 · Cited by 3
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
