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
0 of 9 cited sources checked · 0 supported · 0 flagged
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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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).”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA 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”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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).”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA 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.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Flagged first, then by citations
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 201–300 of 1,826
Li, X., & Zhao, D. (2011) · Physical Review E · doi:10.1103/physreve.84.062901 · Cited by 46
Sleep staging from the EEG signal using multi-domain feature extraction
Liu, Z. J., Sun, J., Zhang, Y., et al. (2016) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2016.06.006 · Cited by 46
Complex networks for rainfall modeling: Spatial connections, temporal scale, and network size
Jha, S., & Sivakumar, B. (2017) · Journal of Hydrology · doi:10.1016/j.jhydrol.2017.09.030 · Cited by 46
Single-trajectory spectral analysis of scaled Brownian motion
Sposini, V., Metzler, R., & Oshanin, G. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab2f52 · Cited by 46
Zhou, C., Ding, L., Zhou, Y., et al. (2019) · Tunnelling and Underground Space Technology · doi:10.1016/j.tust.2019.03.019 · Cited by 46
Stock Price Pattern Prediction Based on Complex Network and Machine Learning
Caö, H., Lin, T., Li, Y., & Zhang, H. (2019) · Complexity · doi:10.1155/2019/4132485 · Cited by 49
Maritime accidents in the Yangtze River: A time series analysis for 2011–2020
Sui, Z., Wen, Y., Huang, Y., et al. (2022) · Accident Analysis & Prevention · doi:10.1016/j.aap.2022.106901 · Cited by 45
SSGCNet: A Sparse Spectra Graph Convolutional Network for Epileptic EEG Signal Classification
Wang, J., Gao, R., Zheng, H., et al. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3252569 · Cited by 45
Telesca, L., Lovallo, M., Ramírez-Rojas, A., et al. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.08.078 · Cited by 45
Visibility graph analysis of wind speed records measured in central Argentina
Pierini, J. O., Lovallo, M., & Telesca, L. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.05.049 · Cited by 45
Shimada, Y., Ikeguchi, T., & Shigehara, T. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.158701 · Cited by 45
Navigation of carlike robots in an extended dynamic environment with swarm avoidance
Sharma, B. N., Raj, J., & Vanualailai, J. (2017) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3895 · Cited by 45
Characterizing stochastic time series with ordinal networks
Pessa, A. A. B., & Ribeiro, H. V. (2019) · Physical review. E · doi:10.1103/physreve.100.042304 · Cited by 45
Hu, J., Xia, C., Li, H., et al. (2020) · Applied Mathematics and Computation · doi:10.1016/j.amc.2020.125434 · Cited by 45
Marwan, N., & Kurths, J. (2015) · Publication Database PIK (Potsdam Institute for Climate Impact Research (PIK)) · Cited by 45
Multilayer Network from Multivariate Time Series for Characterizing Nonlinear Flow Behavior
Gao, Z., Zhang, S., Dang, W., et al. (2017) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127417500596 · Cited by 44
Uniform framework for the recurrence-network analysis of chaotic time series
Jacob, R., Harikrishnan, K. P., Misra, R., et al. (2016) · Physical review. E · doi:10.1103/physreve.93.012202 · Cited by 44
Multifractality and Network Analysis of Phase Transition
Zhao, L., Li, W., Yang, C. B., Han, J., Su, Z. M., & Zou, Y. (2017) · PLoS ONE · doi:10.1371/journal.pone.0170467 · Cited by 45
Visibility graph based temporal community detection with applications in biological time series
Zheng, M., Domanskyi, S., Piermarocchi, C., & Mias, G. I. (2021) · Scientific Reports · doi:10.1038/s41598-021-84838-x · Cited by 51
SimVGNets: Similarity-Based Visibility Graph Networks for Carbon Price Forecasting
Mao, S., & Zeng, X. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120647 · Cited by 45
Indications for a North Atlantic ocean circulation regime shift at the onset of the Little Ice Age
Schleussner, C., Divine, D., Donges, J. F., et al. (2015) · Climate Dynamics · doi:10.1007/s00382-015-2561-x · Cited by 43
Measuring complexity to infer changes in the dynamics of ecological systems under stress
Dakos, V., & Toscano, F. S. (2016) · Ecological Complexity · doi:10.1016/j.ecocom.2016.08.005 · Cited by 43
Zhang, X., Chen, M. Y., Wang, M., et al. (2019) · Applied Mathematics and Computation · doi:10.1016/j.amc.2019.05.043 · Cited by 43
Sakellariou, K., Stemler, T., & SMALL, M. P. (2019) · Physical review. E · doi:10.1103/physreve.100.062307 · Cited by 43
Transforming Time Series into Complex Networks
SMALL, M. P., Zhang, J., & Xu, X.-K. (2009) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-02469-6_84 · Cited by 43
Ordered visibility graph average aggregation operator: An application in produced water management
Jiang, W. R., Wei, B., Tang, Y., et al. (2017) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4977186 · Cited by 42
WLPVG approach to the analysis of EEG-based functional brain network under manual acupuncture
Pei, X., Wang, J., Deng, B., Wei, X., & Yu, H. (2014) · Cognitive Neurodynamics · doi:10.1007/s11571-014-9297-x · Cited by 42
Sequential motif profile of natural visibility graphs
Iacovacci, J., & Lacasa, L. (2016) · Physical review. E · doi:10.1103/physreve.94.052309 · Cited by 43
Self-citationJiang, M., Gao, X., An, H., et al. (2017) · Scientific Reports · doi:10.1038/s41598-017-10759-3 · Cited by 42
A novel approach for oil price forecasting based on data fluctuation network
Wang, M., Tian, L., & Zhou, P. (2018) · Energy Economics · doi:10.1016/j.eneco.2018.02.021 · Cited by 42
Chen, X., Wang, Z., Zhang, Z., Jia, L., & Qin, Y. (2018) · Sensors · doi:10.3390/s18072097 · Cited by 42
Networks of Motifs from Sequences of Symbols
Sinatra, R., Condorelli, D. F., & Latora, V. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.178702 · Cited by 39
Complex Networks Unveiling Spatial Patterns in Turbulence
Scarsoglio, S., Iacobello, G., & Ridolfi, L. (2016) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127416502230 · Cited by 41
Wang, M., Vilela, A. L. M., Du, R., et al. (2018) · Scientific Reports · doi:10.1038/s41598-018-23388-1 · Cited by 41
Single-trajectory spectral analysis of scaled Brownian motion
Sposini, V., Metzler, R., & Oshanin, G. (2019) · publish.UP (University of Potsdam) · doi:10.25932/publishup-43652 · Cited by 41
Krishnan, A., Sujith, R. I., Marwan, N., & Kurths, J. (2021) · Journal of Fluid Mechanics · doi:10.1017/jfm.2021.166 · Cited by 42
Complex tourism systems: a visibility graph approach
Baggio, R. (2014) · Kybernetes · doi:10.1108/k-12-2013-0266 · Cited by 41
Wadhera, T., & Mahmud, M. (2022) · IEEE International Joint Conference on Neural Network · doi:10.1109/ijcnn55064.2022.9892799 · Cited by 17
Li, X., Wang, Y., Zhao, S., Yao, J., & Li, M. (2024) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2024.111761 · Cited by 40
Abdollahpour, M., Rezaii, T. Y., Farzamnia, A., & Saad, I. (2020) · IEEE Access · doi:10.1109/access.2020.3027289 · Cited by 44
Algorithmic Approaches for Assessing Irreversibility in Time Series: Review and Comparison
Zanin, M., & Papo, D. (2021) · Entropy · doi:10.3390/e23111474 · Cited by 40
A straightforward edge centrality concept derived from generalizing degree and strength
Bröhl, T., & Lehnertz, K. (2022) · Scientific Reports · doi:10.1038/s41598-022-08254-5 · Cited by 40
Quantifying sudden changes in dynamical systems using symbolic networks
Masoller, C., Hong, Y., Ayad, S., et al. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/2/023068 · Cited by 40
Predictors of oil shocks. Econophysical approach in environmental science
Бєлінський, А. О., Khvostina, I., Mamanazarov, A., et al. (2021) · IOP Conference Series Earth and Environmental Science · doi:10.1088/1755-1315/628/1/012019 · Cited by 39
Feature-level fusion based on spatial-temporal of pervasive EEG for depression recognition
Zhang, B., Wei, D., Yan, G., Lei, T., Cai, H., & Yang, Z. (2022) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2022.107113 · Cited by 39
Classification of cardiac disorders using weighted visibility graph features from ECG signals
Kutluana, G., & Türker, İ. (2023) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2023.105420 · Cited by 39
Gao, X., An, H., Fang, W., et al. (2014) · Physical Review E · doi:10.1103/physreve.90.012818 · Cited by 39
Random walks on non-homogenous weighted Koch networks
Dai, M., Li, X., & Xi, L. (2013) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4810927 · Cited by 39
Ruan, Y., Donner, R. V., Guan, S., et al. (2019) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5086527 · Cited by 39
Visibility graph analysis of economy policy uncertainty indices
Dai, P., Xiong, X., & Zhou, W. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.121748 · Cited by 39
Tsiotas, D., & Magafas, L. (2020) · Physics · doi:10.3390/physics2020017 · Cited by 39
Ictal time-irreversible intracranial EEG signals as markers of the epileptogenic zone
Schindler, K. A., Rummel, C., Andrzejak, R. G., Goodfellow, M., Zubler, F., Abela, E., Wiest, R., Pollo, C., Steimer, A., & Gast, H. (2016) · Clinical Neurophysiology · doi:10.1016/j.clinph.2016.07.001 · Cited by 38
Speech emotion recognition via graph-based representations
Pentari, A., Kafentzis, G. P., & Tsiknakis, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-52989-2 · Cited by 38
Earthquake magnitude time series: scaling behavior of visibility networks
Aguilar-Sanjuan, B., & Guzmán-Vargas, L. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-40762-2 · Cited by 38
Liu, J., Yu, Z., & Anh, V. (2014) · Physical Review E · doi:10.1103/physreve.89.032814 · Cited by 37
Hidden geometry of traffic jamming
Andjelković, M., Gupte, N., & Tadić, B. (2015) · Physical Review E · doi:10.1103/physreve.91.052817 · Cited by 38
Geometrical invariability of transformation between a time series and a complex network
Zhao, Y., Weng, T., & Ye, S. (2014) · Physical Review E · doi:10.1103/physreve.90.012804 · Cited by 38
Visibility graphs and symbolic dynamics
Lacasa, L., & Just, W. (2018) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2018.04.001 · Cited by 38
Self-citationNatural visibility encoding for time series and its application in stock trend prediction
Huang, Y., Mao, X., & Deng, Y. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.107478 · Cited by 42
New Approach to Epileptic Diagnosis Using Visibility Graph of High-Frequency Signal
Tang, X., Xia, L., Liao, Y., et al. (2013) · Clinical EEG and Neuroscience · doi:10.1177/1550059412464449 · Cited by 38
Self-organized topology of recurrence-based complex networks
Yang, H. Y., & Liu, G. (2013) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4829877 · Cited by 38
A Comprehensive Survey of Machine Learning Based Localization with Wireless SignalsPreprint
Burghal, D., Ravi, A. T., Rao, V. V., Alghafis, A., & Molisch, A. F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.11171 · Cited by 37
Rethinking the Prevalence and Relevance of Chaos in Ecology
Munch, S. B., Rogers, T. L., Johnson, B. J., Bhat, U., & Tsai, C. (2022) · Annual Review of Ecology Evolution and Systematics · doi:10.1146/annurev-ecolsys-111320-052920 · Cited by 35
Rhythmic Dynamics and Synchronization via Dimensionality Reduction: Application to Human Gait
Zhang, J., Zhang, K., Feng, J., & SMALL, M. P. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001033 · Cited by 37
Mali, P., Manna, S. K., Mukhopadhyay, A., et al. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.10.015 · Cited by 37
EEG-Based Emotion Recognition Using an Improved Weighted Horizontal Visibility Graph
Kong, T., Shao, J., Hu, J., Yang, X. M., Yang, S., & Malekian, R. (2021) · Sensors · doi:10.3390/s21051870 · Cited by 39
Charakopoulos, A., Katsouli, G. A., & Karakasidis, T. E. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.12.027 · Cited by 38
Nowak, J., Eng, R. C., Matz, T. W., et al. (2021) · Nature Communications · doi:10.1038/s41467-020-20730-y · Cited by 36
Wang, J., Liang, S., Zhang, J., et al. (2023) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2023.3299839 · Cited by 36
Gotoda, H., Kobayashi, H., & Hayashi, K. (2017) · Physical review. E · doi:10.1103/physreve.95.022201 · Cited by 36
Jiang, H.-Q., Wang, R.-X., Gao, J.-M., Gao, Z.-Y., & Gao, X. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.03.011 · Cited by 37
Visibility graphs of ground-level ozone time series: A multifractal analysis
Carmona-Cabezas, R., Ariza-Villaverde, A. B., de Ravé, E. G., et al. (2019) · The Science of The Total Environment · doi:10.1016/j.scitotenv.2019.01.147 · Cited by 36
A Fast Algorithm for Network Forecasting Time Series
Liu, F., & Deng, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2926986 · Cited by 36
Murayama, S., & Gotoda, H. (2019) · Physical review. E · doi:10.1103/physreve.99.052222 · Cited by 36
Spatiotemporal data analysis with chronological networks
Ferreira, L. N., Vega‐Oliveros, D. A., Cotacallapa, M., et al. (2020) · RePEc: Research Papers in Economics · Cited by 36
Time2Graph+: Bridging Time Series and Graph Representation Learning via Multiple Attentions
Cheng, Z., Yang, Y., Jiang, S., Hu, W., Ying, Z., Chai, Z., & Wang, C. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3094908 · Cited by 37
Fractal analysis on human dynamics of library loans
Fan, C., Guo, J.-L., & Zha, Y. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.06.063 · Cited by 35
Hurst exponent estimation of self-affine time series using quantile graphs
Campanharo, A. S. L. O., & Ramos, F. M. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.09.094 · Cited by 36
Fully developed turbulence in the view of horizontal visibility graphs
Manshour, P., Tabar, M. R. R., & Peinke, J. (2015) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2015/08/p08031 · Cited by 36
Yu, M., Hillebrand, A., Gouw, A. A., & Stam, C. J. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2017.05.047 · Cited by 36
Amigó, J. M., & Rosso, O. A. (2023) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0167263 · Cited by 35
Time-series analysis of networks: Exploring the structure with random walks
Weng, T., Zhao, Y., SMALL, M. P., & Huang, D. D. (2014) · Physical Review E · doi:10.1103/physreve.90.022804 · Cited by 35
Visibility Network Patterns and Methods for Studying Visual Relational Phenomena in Archeology
Brughmans, T., & Brandes, U. (2017) · Frontiers in Digital Humanities · doi:10.3389/fdigh.2017.00017 · Cited by 40
Complex Network Construction of Multivariate Time Series Using Information Geometry
Sun, J., Yang, Y., Xiong, N. N., Dai, L., Peng, X., & Luo, J. (2017) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2017.2751504 · Cited by 34
Bio-Signal Complexity Analysis in Epileptic Seizure Monitoring: A Topic Review
Mei, Z., Zhao, X. F., Chen, H., & Chen, W. (2018) · Sensors · doi:10.3390/s18061720 · Cited by 35
Zhang, X., Landsness, E. C., Chen, W., Miao, H., Tang, M., Brier, L. M., Culver, J. P., Lee, J., & Anastasio, M. A. (2021) · Journal of Neuroscience Methods · doi:10.1016/j.jneumeth.2021.109421 · Cited by 36
Fractal and complex network analyses of protein molecular dynamics
Zhou, Y.-W., Liu, J., Yu, Z., et al. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.08.047 · Cited by 35
Visibility graphs of random scalar fields and spatial data
Lacasa, L., & Iacovacci, J. (2017) · Physical review. E · doi:10.1103/physreve.96.012318 · Cited by 35
Self-citationComplex network theory-based condition recognition of electromechanical system in process industry
Wang, R., Gao, J., Gao, Z., et al. (2016) · Science China Technological Sciences · doi:10.1007/s11431-016-6025-2 · Cited by 34
A scene-adaptive descriptor for visual SLAM-based locating applications in built environments
Xu, L., Feng, C., Kamat, V. R., & Menassa, C. C. (2020) · Automation in Construction · doi:10.1016/j.autcon.2019.103067 · Cited by 34
Dynamic behavior of intermittent combustion oscillations in a model rocket engine combustor
Aoki, C., Gotoda, H., Yoshida, S., et al. (2020) · Journal of Applied Physics · doi:10.1063/5.0001900 · Cited by 34
Huang, C., Mi, X., & Kang, B. (2021) · International Journal of Intelligent Systems · doi:10.1002/int.22456 · Cited by 34
Network Theory Based EHG Signal Analysis and its Application in Preterm Prediction
Xu, J., Wang, M., Zhang, J., et al. (2022) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2022.3140427 · Cited by 34
Network Analysis of Time Series: Novel Approaches to Network Neuroscience
Varley, T. F., & Sporns, O. (2022) · Frontiers in Neuroscience · doi:10.3389/fnins.2021.787068 · Cited by 36
Time-dependent limited penetrable visibility graph analysis of nonstationary time series
Gao, Z., Cai, Q., Yang, Y., & Dang, W. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.02.038 · Cited by 33
Learning and distinguishing time series dynamics via ordinal patterns transition graphs
Borges, J. B., Ramos, H. S., Mini, R. A. F., Rosso, O. A., Frery, A. C., & Loureiro, A. A. F. (2019) · Applied Mathematics and Computation · doi:10.1016/j.amc.2019.06.068 · Cited by 31
Charakopoulos, A., Karakasidis, T. E., & Sarris, I. E. (2019) · Energy Policy · doi:10.1016/j.enpol.2019.110934 · Cited by 33
Wadhera, T., & Kakkar, D. (2021) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2021.102556 · Cited by 35
Formation mechanism of high-frequency combustion oscillations in a model rocket engine combustor
Shima, S., Nakamura, K., Gotoda, H., et al. (2021) · Physics of Fluids · doi:10.1063/5.0048785 · Cited by 33
Multi-scale transition network approaches for nonlinear time series analysis
Wang, X., Han, X., Chen, Z., et al. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.112026 · Cited by 33
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
