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,001–1,100 of 1,826
Analyzing spatial characters of the ECG signal via complex network method
Sun, X., Zhao, Y., & Xue, X. (2011) · International Conference on Biomedical Engineering and Informatics (BMEI) · doi:10.1109/bmei.2011.6098582 · Cited by 5
Classification of electromyogram using vertical visibility algorithm with support vector machine
Artameeyanant, P., Sultornsanee, S., Chamnongthai, K., et al. (2014) · doi:10.1109/apsipa.2014.7041820 · Cited by 5
Horizontal visibility graphs are uniquely determined by their directed degree sequence
O’Pella, J. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.04.159 · Cited by 5
Huang, Y., Deng, Q., & Fu, Z. (2019) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2019.104908 · Cited by 5
Dong, X., Gao, X., Dong, Z., et al. (2019) · International Journal of Modern Physics B · doi:10.1142/s0217979219502060 · Cited by 5
Shengli, L., & Yongtu, L. (2019) · International Journal of Critical Infrastructure Protection · doi:10.1016/j.ijcip.2019.100308 · Cited by 5
Yu, X., Shi, S., Xu, L., et al. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.123381 · Cited by 5
Bhaduri, S., & Ghosh, D. (2016) · Advances in High Energy Physics · doi:10.1155/2016/6848197 · Cited by 5
Directed and undirected network evolution from Euler–Lagrange dynamics
Wang, J., Wilson, R. C., & Hancock, E. R. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.03.029 · Cited by 5
Investigation on Law and Economics Based on Complex Network and Time Series Analysis
Yang, J. Y., Qu, Z., & Chang, H. (2015) · PLoS ONE · doi:10.1371/journal.pone.0127001 · Cited by 5
Multifractal characterisation and analysis of complex networks
Wang, D. (2011) · Cited by 5
The Number of Confirmed Cases of Covid-19 by using Machine Learning: Methods and ChallengesPreprint
Ahmada, A., Garhwal, S., Ray, S. K., Kumar, G., Malebary, S. J., & Barukab, O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.09184 · Cited by 5
Decat, N., Walter, J., Koh, Z. H., Sribanditmongkol, P., Fulcher, B., Windt, J., Andrillon, T., & Tsuchiya, N. (2021) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2021.09.08.458981 · Cited by 6
Graph-let based approach to evolutionary behaviors in chaotic time series
Yan, S., Gu, C., & Yang, H. (2024) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2024.108344 · Cited by 4
Feature analysis of 5G traffic data based on visibility graph
Sun, K., & Xu, J. (2024) · Frontiers in Physics · doi:10.3389/fphy.2024.1477382 · Cited by 4
Optimizing self-organized topology of recurrence-based complex networks
Li, C., Lai, J. C. S., & Oberst, S. M. (2025) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0249500 · Cited by 4
A Simple Overview of Complex Systems and Complexity Measures
Monteiro, L. H. A. (2025) · Complexities · doi:10.3390/complexities1010002 · Cited by 5
Lin, X., Chen, L., Lu, Q., et al. (2025) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2025.111726 · Cited by 4
Dynamics-informed reservoir computing with visibility graphs
Geier, C., Shanaz, R., & Stender, M. (2025) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0293030 · Cited by 4
Scudero, S., & D’Alessandro, A. (2025) · Scientific Reports · doi:10.1038/s41598-025-16435-1 · Cited by 4
Motion Artifact Removal from EEG Signals Using the Motion-Net Deep Learning Algorithm
kibrislioglu, E., & Laleg‐Kirati, T. (2025) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2025.108877 · Cited by 4
Automatic Modulation Classification Based on a Dynamic Graph Architecture
Liu, X., Mao, Z., Liu, M., Wang, C., & Cai, Z. (2025) · Applied Sciences · doi:10.3390/app152111782 · Cited by 4
Singh, A., Supriya, S., Siuly, S., & Wang, H. (2025) · Sensors · doi:10.3390/s25247439 · Cited by 4
A review of graph neural networks for rolling bearing fault diagnosis
Yang, S., & Liu, R. (2025) · Measurement Science and Technology · doi:10.1088/1361-6501/ae2e29 · Cited by 7
Learning across modalities: a systematic survey of multimodal models for financial analysis
D’Amico, S., Mercorio, F., Nobani, N., Sperlí, G., & Ventre, C. (2026) · Information Fusion · doi:10.1016/j.inffus.2026.104249 · Cited by 6
An Improved Ordered Visibility Graph Aggregation Operator for MADM
Wang, D., Tian, F., & Wei, D. (2022) · IEEE Access · doi:10.1109/access.2022.3172684 · Cited by 4
Using visibility graphs to characterize non-Maxwellian turbulent plasmas
Saldivia, S. I., Pastén, D., & Moya, P. S. (2024) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2024.114948 · Cited by 4
A two‐phase features extraction approach for BRB based fault diagnosis of electromechanical system
Zhang, Z., Liu, W., Xiao, G., Xu, X., Li, M., Cheng, Z., Zhang, Y., Xu, W., & Chang, L. (2024) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.3862 · Cited by 4
Multiple serial correlations in global air temperature anomaly time series
Gao, M., Fang, X., Ge, R., et al. (2024) · PLoS ONE · doi:10.1371/journal.pone.0306694 · Cited by 4
Gund, J., Mishra, Y., Mallick, B. N., & Singh, R. K. (2025) · Applied Network Science · doi:10.1007/s41109-024-00688-2 · Cited by 3
A complex network analysis of urban human mobility in Tokyo
Derdouri, A., & Osaragi, T. (2025) · Travel Behaviour and Society · doi:10.1016/j.tbs.2025.101020 · Cited by 5
A Prediction of Solar Cycle Maxima Using Visibility Graphs
Flández, E., & Muñoz, V. (2025) · The Astrophysical Journal · doi:10.3847/1538-4357/adef43 · Cited by 4
Relating the large-scale structure of time series and visibility networks
Rodríguez, M. A. (2017) · Physical review. E · doi:10.1103/physreve.95.062309 · Cited by 4
Bhaduri, S., Bhaduri, A., & Ghosh, D. (2019) · Physics of Particles and Nuclei Letters · doi:10.1134/s1547477119030051 · Cited by 4
Construction Cost Index Prediction: A Visibility Graph Network Method
Mao, S., Tseng, C.-H., Shang, J., et al. (2021) · doi:10.1109/ijcnn52387.2021.9534002 · Cited by 4
Ramírez-Rojas, A., & Flores-Márquez, E. L. (2022) · Entropy · doi:10.3390/e24040480 · Cited by 4
Salinas-Martínez, A., Aguilar-Molina, A. M., Pérez-Oregon, J., et al. (2022) · Entropy · doi:10.3390/e24040435 · Cited by 4
Properties analysis of refugee populations around the world: A visibility graph network approach
Wang, L., Ji, H., Xiaojun, P., Zeng, L., Hu, J., Zhu, S., Lai, F., & Li, H. (2022) · Modern Physics Letters B · doi:10.1142/s0217984922500208 · Cited by 4
Yao, W., Yao, W., Yao, W., et al. (2022) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2022.106925 · Cited by 4
Classification of Alzheimer’s Disease Based on White Matter Connectivity Network
Yang, X., Xia, Y., Li, Z., et al. (2023) · Applied Sciences · doi:10.3390/app132112030 · Cited by 4
Graph- and Machine-Learning-Based Texture Classification
Ali, M., Kumar, S., Pal, R., et al. (2023) · Electronics · doi:10.3390/electronics12224626 · Cited by 4
Lu, Y. H., Yao, L., Li, H., et al. (2023) · Heliyon · doi:10.1016/j.heliyon.2023.e22455 · Cited by 4
The network structure of Sturmian sequences based on HVG
Bai, S., Niu, M., & Wang, Y. H. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129445 · Cited by 4
Poudel, G. R., Sharma, P., Lorenzetti, V., et al. (2024) · Neuroinformatics · doi:10.1007/s12021-024-09652-y · Cited by 4
Gershgorin circle theorem-based feature extraction for biomedical signal analysis
Patel, S. A., Smith, R. J., & Yildirim, A. (2024) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2024.1395916 · Cited by 4
Detection of Shockable Ventricular Arrhythmias Using Multiscale Visual Graph Network
Han, X., Cai, Z., Gao, H., et al. (2025) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2025.3541701 · Cited by 4
“Brain state network dynamics in pediatric epilepsy: Chaotic attractor transition ensemble network”
Sirpal, P., Sikora, W. A., & Refai, H. H. (2025) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2025.109832 · Cited by 5
Yang, X., Jiang, G., Zhu, Z., Wu, D., He, A., & Wang, J. (2025) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2025.3554309 · Cited by 4
From view of complex network: Fractal dimension of music notation
Wang, N., & Wei, D. (2014) · doi:10.1109/ccdc.2014.6852813 · Cited by 4
Complex networks from lévy noise
Zhang, J. F., & Shao, Z.-G. (2011) · Indian Journal of Physics · doi:10.1007/s12648-011-0163-y · Cited by 4
Emergence of fit-get-rich networks from chaotic attractors
Shimada, Y., & Ikeguchi, T. (2010) · Physics Letters A · doi:10.1016/j.physleta.2010.05.048 · Cited by 4
Wang, F., Meng, Q., Xie, H., et al. (2014) · doi:10.1109/embc.2014.6944317 · Cited by 4
Manifestations of the onset of chaos in condensed matter and complex systems
Velarde, C., & Robledo, A. (2018) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2018-00128-9 · Cited by 4
Echo state network-based visibility graph method for nonlinear time series prediction
Li, Q., Chen, Y., Ao, N., et al. (2018) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2018.8407428 · Cited by 4
Makaram, N., & Swaminathan, R. (2018) · doi:10.1109/lsc.2018.8572060 · Cited by 4
Speech and Music – Nonlinear Acoustical Decoding in Neurocognitive Scenario
Bhaduri, S., & Ghosh, D. C. (2018) · Archives of Acoustics · doi:10.24425/aoa.2018.125153 · Cited by 4
Babič, M., Marina, N., Mrvar, A., et al. (2019) · Journal of Healthcare Engineering · doi:10.1155/2019/4373760 · Cited by 4
Quantifying information loss on chaotic attractors through recurrence networks
Harikrishnan, K. P., Misra, R., & Ambika, G. (2019) · Physics Letters A · doi:10.1016/j.physleta.2019.125854 · Cited by 4
Han, J. (2020) · Scientific Reports · doi:10.1038/s41598-020-64021-4 · Cited by 4
Monteleone, V., Presti, L. L., Cascia, M. L., Gauthier, S., Xavier, J., Zaoui, M., Berthoz, A., Cohen, D., Chétouani, M., & Anzalone, S. M. (2020) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2020.3023196 · Cited by 4
A zodiac of studies on complex systems
Robledo, A., & Camacho-Vidales, L. J. (2020) · Suplemento de la Revista Mexicana de Física · doi:10.31349/suplrevmexfis.1.4.32 · Cited by 4
Closeness-centrality-correlation for detecting interdependency between coupled systems
Yang, G., Xu, D., & Zhang, H. (2021) · Modern Physics Letters B · doi:10.1142/s021798492150216x · Cited by 4
Weighted recurrence network for characterizing continuous dynamical systems
Yang, G., Xu, D., Zhang, H., et al. (2021) · Modern Physics Letters B · doi:10.1142/s0217984921503619 · Cited by 4
Activity recognition using multiplex limited penetrable visibility graph
Song, L., Xiang, C., Guo, H., et al. (2021) · Journal of the mechanical behavior of biomedical materials/Journal of mechanical behavior of biomedical materials · doi:10.1016/j.jmbbm.2021.104880 · Cited by 4
Applying Visibility Graphs to Classify Time Series
Kirichenko, L., Радівілова, Т., & Ryzhanov, V. (2021) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-030-82014-5_26 · Cited by 4
Visibility Graphs, Persistent Homology, and Rolling Element Bearing Fault Detection
Lee, D., & Sabater, A. B. (2022) · IEEE Conference on Prognostics and Health Management · doi:10.1109/icphm53196.2022.9815768 · Cited by 4
Identify the characteristic in the evolution of the causality between the gold and dollar
Wang, P., Gu, C., Yang, H., et al. (2022) · Electronic Research Archive · doi:10.3934/era.2022187 · Cited by 4
A simplicial analysis of the fMRI data from human brain dynamics under functional cognitive tasks
Bishal, R., Cherodath, S., Singh, N. C., et al. (2022) · Frontiers in Network Physiology · doi:10.3389/fnetp.2022.924446 · Cited by 4
Pérez, Y. V., & Pereira, F. H. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128772 · Cited by 5
Integration of Text and Graph-Based Features for Depression Detection Using Visibility Graph
Ghadiri, N., Samani, R., & Shahrokh, F. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-27440-4_32 · Cited by 4
Global carbon dioxide emissions analysis based on time series visualization
Liu, X., Zhao, M., & Miao, Q. (2023) · Frontiers in Physics · doi:10.3389/fphy.2023.1201983 · Cited by 4
Iglesias-Perez, S., & Criado, R. (2023) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2023.113940 · Cited by 3
Spatio-temporal patterns of hot extremes in China based on complex network analysis
Zhang, P., Dai, E., Wu, C., et al. (2023) · Climate Dynamics · doi:10.1007/s00382-023-06947-9 · Cited by 4
Viewing China's escalating heatwaves through the lens of complex networks
Zhang, P., Dai, E., Wu, C., et al. (2023) · Ecological Indicators · doi:10.1016/j.ecolind.2023.111248 · Cited by 4
Dwivedi, D., Babu, K. V. S. M., Yemula, P. K., et al. (2024) · e-Prime - Advances in Electrical Engineering Electronics and Energy · doi:10.1016/j.prime.2024.100714 · Cited by 4
Temporal Dynamics of fNIRS-Recorded Signals Revealed Via Visibility Graph
Zhu, L., & Najafizadeh, L. (2016) · Biomedical optics · doi:10.1364/cancer.2016.jw3a.53 · Cited by 4
Zhao, Z., Luo, L., & Liu, X. (2018) · American journal of biochemistry & biotechnology/American journal of biochemistry and biotechnology · doi:10.3844/ajbbsp.2018.67.75 · Cited by 4
Makaram, N., & Swaminathan, R. (2018) · doi:10.1109/embc.2018.8512844 · Cited by 4
Model Classification of Guided Wave Signal based on the Visibility Graph and SVM
Mu, W., Zhengxing, Z. O. U., Sun, H., et al. (2018) · IEEE Far East NDT New Technology & Application Forum (FENDT) · doi:10.1109/fendt.2018.8681982 · Cited by 4
Zhang, B., Xie, F., Fu, Z., et al. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.04.131 · Cited by 4
Recurrence Networks in Natural Languages
Baeza-Blancas, E., Obregón-Quintana, B., Hernández-Gómez, C., et al. (2019) · Entropy · doi:10.3390/e21050517 · Cited by 4
Spectral Visibility Graphs: Application to Similarity of Harmonic Signals
Yela, D. F., Stowell, D., & Sandler, M. B. (2019) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco.2019.8903055 · Cited by 4
Nonlinear time series analysis by means of complex networks
Donner, R. V., Marwan, N., Yong, Z., et al. (2019) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2019-0136 · Cited by 4
Universal visibility patterns of unimodal maps
Nuño, J. C., & Muñoz, F. J. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0006652 · Cited by 4
Self-citationDynamic heteroscedasticity of time series interpreted as complex networks
An, S., Gao, X., Jiang, M., et al. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5129224 · Cited by 4
EXTREME EVENTS ANALYSIS OF NON-STATIONARY TIME SERIES BY USING HORIZONTAL VISIBILITY GRAPH
Zhao, X., Sun, J., Zhang, N., et al. (2020) · Fractals · doi:10.1142/s0218348x20500899 · Cited by 4
Craciunescu, T., Murari, A., Lerche, E., et al. (2020) · Entropy · doi:10.3390/e22070775 · Cited by 4
A Fast Shortest Path Algorithm on Terrain-like Graphs
Froese, V., & Renken, M. (2020) · Discrete & Computational Geometry · doi:10.1007/s00454-020-00226-8 · Cited by 4
Complex Networks of the Air Passenger Traffic in Monterrey´s Airport
Reyna, O. S. S., & Flores, I. (2020) · Transportation research procedia · doi:10.1016/j.trpro.2020.08.003 · Cited by 4
Chen, G., Lu, G., & Yan, P. (2020) · 2020 11th International Conference on Prognostics and System Health Management (PHM-2020 Jinan) · doi:10.1109/phm-jinan48558.2020.00042 · Cited by 4
Visibility Graph Analysis of Particle Size Distribution During Flocculation for Water Treatment
Silva, K. J. S., Lima, L. L., Nunes, G. S., et al. (2021) · Water Air & Soil Pollution · doi:10.1007/s11270-021-05052-z · Cited by 4
Bearing Fault Detection in Induction Motors Employing Difference Visibility Graph
Roy, S. S., Chatterjee, S., Barman, R., et al. (2020) · IEEE International Conference on Power Electronics, Drives and Energy Systems · doi:10.1109/pedes49360.2020.9379635 · Cited by 4
A revision of seismicity models based on complex systems and earthquake networks
León, D. A., Valdivia, J. A., & Bucheli, V. (2021) · Journal of Seismology · doi:10.1007/s10950-021-10017-0 · Cited by 4
Detecting the dynamical instability of complex time series via partitioned entropy
Shiozawa, K., Uemura, T., & Tokuda, I. T. (2023) · Physical review. E · doi:10.1103/physreve.107.014207 · Cited by 4
Complexity Concepts and Non-Integer Dimensions in Climate and Paleoclimate Research
Donner, R. V. (2012) · InTech eBooks · doi:10.5772/53559 · Cited by 4
Relation between HVG-irreversibility and persistence in the modified Langevin equation
Telesca, L., & Czechowski, Z. (2018) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5030680 · Cited by 4
An efficient non-recursive algorithm for transforming time series to visibility graph
Ghosh, S., & Dutta, A. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.09.053 · Cited by 4
The partial visibility curve of the Feigenbaum cascade to chaos
Nuño, J. C., & Muñoz, F. J. (2019) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2019.109537 · Cited by 4
Self-citationComplexity traits and synchrony of cryptocurrencies price dynamics
Provenzano, D., & Baggio, R. (2021) · Decisions in Economics and Finance · doi:10.1007/s10203-021-00319-w · Cited by 4
Tiwari, M., & Wong, Y.-M. (2022) · International Journal of Modern Physics B · doi:10.1142/s021797922240080x · Cited by 4
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
