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 401–500 of 1,826
Sun, X., Fang, W., Gao, X., et al. (2021) · Resources Policy · doi:10.1016/j.resourpol.2021.102385 · Cited by 24
Quasiperiodic Graphs: Structural Design, Scaling and Entropic Properties
Luque, B., Ballesteros, F. J., Núñez, A. M., et al. (2012) · Journal of Nonlinear Science · doi:10.1007/s00332-012-9153-2 · Cited by 24
Self-citationSuperfamily classification of nonstationary time series based on DFA scaling exponents
Liu, C., & Zhou, W. (2010) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/43/49/495005 · Cited by 24
Gao, Z., Yang, Y., Cai, Q., et al. (2016) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4954271 · Cited by 24
Checking complex networks indicators in search of singular episodes of the photochemical smog
Carmona-Cabezas, R., Gómez-Gómez, J., de Ravé, E. G., et al. (2019) · Chemosphere · doi:10.1016/j.chemosphere.2019.125085 · Cited by 24
Arrow of time across five centuries of classical music
González-Espinoza, A., Martínez‐Mekler, G., & Lacasa, L. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033166 · Cited by 24
Self-citationMapping images into ordinal networks
Pessa, A. A. B., & Ribeiro, H. V. (2020) · Physical review. E · doi:10.1103/physreve.102.052312 · Cited by 24
Data-driven Detection and Early Prediction of Thermoacoustic Instability in a Multi-nozzle Combustor
Bhattacharya, C., O'Connor, J. A., & Ray, A. (2020) · Combustion Science and Technology · doi:10.1080/00102202.2020.1820495 · Cited by 27
Power-laws in recurrence networks from dynamical systems
Zou, Y., Heitzig, J. ;. H. O.-0.-0.-8., Donner, R., et al. (2012) · Publication Database PIK (Potsdam Institute for Climate Impact Research (PIK)) · Cited by 24
Randomness criteria in binary visibility graph and complex network perspective
Ahadpour, S., & Sadra, Y. (2012) · Information Sciences · doi:10.1016/j.ins.2012.02.022 · Cited by 23
Partida, A., Criado, R., & Romance, M. (2021) · Electronics · doi:10.3390/electronics10040378 · Cited by 23
New feature extraction for automated detection of epileptic seizure using complex network framework
Supriya, S., Siuly, S., Wang, H., & Zhang, Y. (2021) · Applied Acoustics · doi:10.1016/j.apacoust.2021.108098 · Cited by 23
Fuzzy-Based Time Series Forecasting and Modelling: A Bibliometric Analysis
Palomero, L., García, V., & Sánchez, J. S. (2022) · Applied Sciences · doi:10.3390/app12146894 · Cited by 23
The chaotic, self-similar and hierarchical patterns in Bitcoin and Ethereum price series
Partida, A., Gerassis, S., Criado, R., et al. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.112806 · Cited by 23
TimeGNN: Temporal Dynamic Graph Learning for Time Series Forecasting
Xu, N., Kosma, C., & Vazirgiannis, M. (2024) · Studies in computational intelligence · doi:10.1007/978-3-031-53468-3_8 · Cited by 27
Complex network approach to fractional time series
Manshour, P. (2015) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4930839 · Cited by 23
Communication Theoretic Data Analytics
Chen, K.-C., Huang, S., Zheng, L., & Poor, H. V. (2015) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2393471 · Cited by 23
Feigenbaum graphs at the onset of chaos
Luque, B., Lacasa, L., & Robledo, A. (2012) · Physics Letters A · doi:10.1016/j.physleta.2012.10.050 · Cited by 23
Self-citationQuantifying instabilities in Financial Markets
Gonçalves, B. A., Carpi, L. C., Rosso, O. A., et al. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.03.029 · Cited by 23
Graph theory applied to the analysis of motor activity in patients with schizophrenia and depression
Fasmer, E. E., Fasmer, O. B., Berle, J. Ø., Oedegaard, K. J., & Hauge, E. R. (2018) · PLoS ONE · doi:10.1371/journal.pone.0194791 · Cited by 23
Visibility graph analysis of temporal irreversibility in sleep electroencephalograms
Xiong, H., Shang, P., Hou, F., & Ma, Y. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-04768-2 · Cited by 23
Estimate and characterize PV power at demand-side hybrid system
Li, Q., Wu, Z., & Xia, X. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.02.160 · Cited by 22
Insights on Streamflow Predictability Across Scales Using Horizontal Visibility Graph Based Networks
Ghimire, G. R., Jadidoleslam, N., Krajewski, W. F., & Tsonis, A. A. (2020) · Frontiers in Water · doi:10.3389/frwa.2020.00017 · Cited by 22
Subramaniyam, N. P., Donner, R. V., Caron, D., Panuccio, G., & Hyttinen, J. (2021) · Nonlinear Dynamics · doi:10.1007/s11071-021-06610-0 · Cited by 22
Research on LPI radar signal detection and parameter estimation technology
Tao, W., Kaili, J., Jingyi, L., et al. (2021) · Journal of Systems Engineering and Electronics · doi:10.23919/jsee.2021.000048 · Cited by 22
Hu, J., Chen, J., Zhu, P., et al. (2022) · Frontiers in Psychology · doi:10.3389/fpsyg.2021.795142 · Cited by 22
Visible Particle Series Search Algorithm and Its Application in Structural Damage Identification
Mohebian, P., Aval, S. B. B., Noori, M. N., Lu, N., & Altabey, W. A. (2022) · Sensors · doi:10.3390/s22031275 · Cited by 22
Modified multiscale sample entropy and cross-sample entropy based on horizontal visibility graph
Lin, G., & Lin, A. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.112802 · Cited by 22
Time series classification by Euclidean distance-based visibility graph
Cheng, L., Zhu, P., Sun, W., Han, Z., Tang, K., & Cui, X. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129010 · Cited by 24
Yu, Z., Zhang, H., Huang, D.-W., et al. (2016) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2016/03/033206 · Cited by 22
Visibility Graph Feature Model of Vibration Signals: A Novel Bearing Fault Diagnosis Approach
Zhang, Z., Qin, Y. F., Jia, L., & Chen, X. (2018) · Materials · doi:10.3390/ma11112262 · Cited by 22
Godavarthi, V., Kasthuri, P., Mondal, S., et al. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5134821 · Cited by 22
Characterizing air quality data from complex network perspective
Fan, X., Wang, L., Xu, H., et al. (2015) · Environmental Science and Pollution Research · doi:10.1007/s11356-015-5596-y · Cited by 21
Du, C., & Tang, B. (2019) · Sensors · doi:10.3390/s19102344 · Cited by 21
Carmona-Cabezas, R., Gómez-Gómez, J., Ariza-Villaverde, A. B., et al. (2019) · Atmospheric Pollution Research · doi:10.1016/j.apr.2019.10.011 · Cited by 21
Zhao, J., Mo, H., & Deng, Y. (2020) · IEEE Access · doi:10.1109/access.2020.2964067 · Cited by 21
VisGraphNet: A complex network interpretation of convolutional neural features
Florindo, J. B., Lee, Y., Jun, K., Jeon, G., & Albertini, M. K. (2020) · Information Sciences · doi:10.1016/j.ins.2020.07.050 · Cited by 23
Complexity and variability analyses of motor activity distinguish mood states in bipolar disorder
Jakobsen, P., Stautland, A., Riegler, M. A., Côté‐Allard, U., Sepasdar, Z., Nordgreen, T., Tørresen, J., Fasmer, O. B., & Oedegaard, K. J. (2022) · PLoS ONE · doi:10.1371/journal.pone.0262232 · Cited by 21
Liu, J., Zhao, X., Luo, R., et al. (2024) · Applied Energy · doi:10.1016/j.apenergy.2024.124261 · Cited by 21
Time irreversibility of mean temperature anomaly variations over China
Xie, F., Fu, Z., Piao, L., et al. (2014) · Theoretical and Applied Climatology · doi:10.1007/s00704-014-1347-0 · Cited by 21
Topological properties of the limited penetrable horizontal visibility graph family
Wang, M., Vilela, A. L. M., Du, R., et al. (2018) · Physical review. E · doi:10.1103/physreve.97.052117 · Cited by 21
Complex network based models of ECoG signals for detection of induced epileptic seizures in rats
Mohammadpoory, Z., Nasrolahzadeh, M., Mahmoodian, N., Sayyah, M., & Haddadnia, J. (2019) · Cognitive Neurodynamics · doi:10.1007/s11571-019-09527-y · Cited by 21
A novel method for forecasting Construction Cost Index based on complex network
Mao, S., & Xiao, F. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.121306 · Cited by 21
Complex systems approaches for Earth system data analysis
Boers, N., Kurths, J., & Marwan, N. (2021) · Journal of Physics Complexity · doi:10.1088/2632-072x/abd8db · Cited by 21
Yen, P. T.-W., Xia, K., & Cheong, S. A. (2021) · Entropy · doi:10.3390/e23091211 · Cited by 22
Xie, W.-J., Han, R.-Q., Zhi-qiang Jiang, A., et al. (2017) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/119/48008 · Cited by 20
Li, X., Sun, M., Gao, C., et al. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.11.040 · Cited by 20
Motion Control of a Flock of 1-Trailer Robots with Swarm Avoidance
Raj, J., Raghuwaiya, K., Sharma, B. N., et al. (2021) · Robotica · doi:10.1017/s0263574721000060 · Cited by 20
Wet scavenging process of particulate matter (PM10): A multivariate complex network approach
Plocoste, T., Carmona-Cabezas, R., de Ravé, E. G., & Jiménez-Hornero, F. J. (2021) · Atmospheric Pollution Research · doi:10.1016/j.apr.2021.101095 · Cited by 23
Morphological and Fractal Properties of Brain Tumors
Sánchez, J., & Martı́n-Landrove, M. (2022) · Frontiers in Physiology · doi:10.3389/fphys.2022.878391 · Cited by 20
Visibility graph analysis for brain: scoping review
Sulaimany, S., & Safahi, Z. (2023) · Frontiers in Neuroscience · doi:10.3389/fnins.2023.1268485 · Cited by 20
Wang, X., Yue, Q., & Liu, X. (2024) · Journal of Building Engineering · doi:10.1016/j.jobe.2024.109124 · Cited by 20
Time-series-analysis-based detection of critical transitions in real-world non-autonomous systems
Lehnertz, K. (2024) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0214733 · Cited by 21
Telesca, L., Lovallo, M., Aggarwal, S. K., et al. (2015) · Physics and Chemistry of the Earth Parts A/B/C · doi:10.1016/j.pce.2015.02.008 · Cited by 20
Murayama, S., Kaku, K., Funatsu, M., et al. (2018) · Proceedings of the Combustion Institute · doi:10.1016/j.proci.2018.07.034 · Cited by 20
Tetradic motif profiles of horizontal visibility graphs
Xie, W.-J., Han, R.-Q., & Zhou, W. (2019) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2019.01.012 · Cited by 20
Complex network analysis of forced synchronization in a hydrodynamically self-excited jet
Murugesan, M., Zhu, Y., & Li, L. K. B. (2019) · International Journal of Heat and Fluid Flow · doi:10.1016/j.ijheatfluidflow.2018.12.004 · Cited by 20
Cardoso-Pereira, I., Borges, J. B., Barros, P. H., Loureiro, A. A. F., Rosso, O. A., & Ramos, H. S. (2021) · Nonlinear Dynamics · doi:10.1007/s11071-021-07059-x · Cited by 20
The earthquakes network: Retrieving the empirical seismological laws
Rezaei, S., Darooneh, A. H., Lotfi, N., et al. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.12.003 · Cited by 20
Analysing the Dynamics of Interbeat Interval Time Series Using Grouped Horizontal Visibility Graph
Choudhary, G. I., Aziz, W., Khan, I. R., et al. (2019) · IEEE Access · doi:10.1109/access.2018.2890542 · Cited by 19
Measuring topological descriptors of complex networks under uncertainty
Raimondo, S., & Domenico, M. D. (2021) · Physical review. E · doi:10.1103/physreve.103.022311 · Cited by 21
Diurnal variation of motor activity in adult ADHD patients analyzed with methods from graph theory
Fasmer, O. B., Fasmer, E. E., Mjeldheim, K., Førland, W., Syrstad, V. E. G., Jakobsen, P., Berle, J. Ø., Henriksen, T. E. G., Sepasdar, Z., Hauge, E. R., et al. (2020) · PLoS ONE · doi:10.1371/journal.pone.0241991 · Cited by 20
Xiu, Y., Wang, G., & Chan, W. K. (2021) · Entropy · doi:10.3390/e23121612 · Cited by 19
Xiong, Y., Li, J., Wu, D., et al. (2022) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2022.104155 · Cited by 19
Recognition of oil & gas pipelines operational states using graph network structural features
Zhang, L., Yeh, L., Su, H., Zeitouni, K., Zuo, Z., Li, M., Jiang, L., Fan, L., & Zhang, J. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.105884 · Cited by 19
The dynamics of laser droplet generation
Krese, B., Perc, M., & Govekar, E. (2010) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3367772 · Cited by 19
Multifractal analysis of solar flare indices and their horizontal visibility graphs
Yu, Z.-G., Anh, V., Eastes, R. W., et al. (2012) · Nonlinear processes in geophysics · doi:10.5194/npg-19-657-2012 · Cited by 19
Scaling in complex systems: a link between the dynamics of networks and growing interfaces
Brú, A., Alòs, E., Nuño, J. C., et al. (2014) · Scientific Reports · doi:10.1038/srep07550 · Cited by 19
Self-citationWang, H., Mo, H., Sadiq, R., et al. (2015) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.06.021 · Cited by 19
Artameeyanant, P., Sultornsanee, S., & Chamnongthai, K. (2017) · Expert Systems · doi:10.1111/exsy.12211 · Cited by 19
Cáceres-Chávez, V. A., Hernandez-Martinez, R., Pérez-Ortega, J., Herrera-Valdez, M. A., Buendia, J. D. J. A., Galarraga, E., & Bargas, J. (2018) · Journal of Neurophysiology · doi:10.1152/jn.00579.2018 · Cited by 19
Markov-binary visibility graph: A new method for analyzing complex systems
Ahadpour, S., Sadra, Y., & ArastehFard, Z. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.007 · Cited by 19
Zhu, C., Fan, R., Sun, J., et al. (2019) · Ecological Indicators · doi:10.1016/j.ecolind.2019.105681 · Cited by 19
Destination Events, Stability, and Turning Points of Development
Sainaghi, R., & Baggio, R. (2019) · Journal of Travel Research · doi:10.1177/0047287519890927 · Cited by 19
Coupling between time series: A network view
Mehraban, S. A., Shirazi, A. H., Zamani, M., et al. (2013) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/103/50011 · Cited by 19
Guo, Y., Zhang, J., Yang, Y., et al. (2014) · Asia Pacific Journal of Tourism Research · doi:10.1080/10941665.2014.948024 · Cited by 19
Analysis of the 2005–2016 Earthquake Sequence in Northern Iran Using the Visibility Graph Method
Khoshnevis, N., Taborda, R., Azizzadeh-Roodpish, S., et al. (2017) · Pure and Applied Geophysics · doi:10.1007/s00024-017-1617-8 · Cited by 19
Dimitri, G. M., Agrawal, S., Young, A. M. H., Donnelly, J., Liu, X., Smielewski, P. S., Hutchinson, P. J., Czosnyka, M., Lió, P., & Haubrich, C. (2017) · Applied Network Science · doi:10.1007/s41109-017-0050-3 · Cited by 19
Partida, A., Criado, R., & Romance, M. (2021) · Electronics · doi:10.3390/electronics10182282 · Cited by 18
Olamat, A., Özel, P., & Akan, A. (2021) · International Journal of Neural Systems · doi:10.1142/s0129065721500416 · Cited by 18
Variational restricted Boltzmann machines to automated anomaly detection
Demertzis, K., Iliadis, L., Pimenidis, E., & Kikiras, P. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07060-4 · Cited by 18
Zuo, D. G., Tang, T., & Chen, M. (2023) · Measurement Science and Technology · doi:10.1088/1361-6501/ace7e5 · Cited by 19
Szeberényi, A., & Bakó, F. (2023) · Energies · doi:10.3390/en16186515 · Cited by 18
Dynamic spatio-temporal interactive clustering strategy for free-floating bike-sharing
Tian, Z., Zhou, J., Tian, L., et al. (2023) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2023.102872 · Cited by 18
Acoustic-Friction Networks and the Evolution of Precursor Rupture Fronts in Laboratory Earthquakes
Ghaffari, H. O., & Young, R. P. (2013) · Scientific Reports · doi:10.1038/srep01799 · Cited by 18
A novel network approach to study communication activities of air traffic controllers
Wang, Y., Bu, J., Han, K., Sun, R., Hu, M., & Zhu, C.-P. (2016) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2016.04.017 · Cited by 18
Extracting Statistical Graph Features for Accurate and Efficient Time Series Classification
Li, D., Lin, J., Bissyandé, T. F., Klein, J., & Traon, Y. L. (2018) · Open Repository and Bibliography (University of Luxembourg) · doi:10.5441/002/edbt.2018.19 · Cited by 17
Kobayashi, W., Gotoda, H., Kandani, S., et al. (2019) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5126490 · Cited by 18
Weighted link entropy and multiscale weighted link entropy for complex time series
Chen, Y., & Lin, A. (2021) · Nonlinear Dynamics · doi:10.1007/s11071-021-06599-6 · Cited by 18
Multilayer Network-Based CNN Model for Emotion Recognition
Dang, W., Lv, D., Li, R., Rui, L.-G., Yang, Z., Ma, C., & Gao, Z. (2022) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127422500110 · Cited by 19
Network topologies of Shanghai stock index
Zhang, J., Zhou, H., Jiang, L., et al. (2010) · Physics Procedia · doi:10.1016/j.phpro.2010.07.012 · Cited by 18
Signatures of chaotic and stochastic dynamics uncovered with ε -recurrence networks
Subramaniyam, N. P., Donges, J. F., & Hyttinen, J. (2015) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2015.0349 · Cited by 18
Scaling and nonlinear behaviour of daily mean temperature time series across India
Ray, R., Khondekar, M. H., Ghosh, K., et al. (2016) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2015.12.016 · Cited by 18
Complex network precursors of crashes and critical events in the cryptocurrency market
Бєлінський, А. О., & Soloviev, V. (2018) · doi:10.31812/123456789/2881 · Cited by 18
Time Series Embedding Methods for Classification Tasks: A Review
Irani, H., Ghahremani, Y., Kermani, A., & Metsis, V. (2025) · Expert Systems · doi:10.1111/exsy.70148 · Cited by 26
Texture classification based on image (natural and horizontal) visibility graph constructing methods
Pei, L., Li, Z., & Liu, J. (2021) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0036933 · Cited by 17
Γιαμαρέλος, Ν., & Zois, E. N. (2024) · Sustainable Energy Grids and Networks · doi:10.1016/j.segan.2024.101304 · Cited by 17
Revealing Higher-Order Interactions in High-Dimensional Complex Systems: A Data-Driven Approach
Tabar, M. R. R., Nikakhtar, F., Parkavousi, L., Akhshi, A., Feudel, U., & Lehnertz, K. (2024) · Physical Review X · doi:10.1103/physrevx.14.011050 · Cited by 16
Measuring persistence in a stationary time series using the complex network theory
Karimi, S., & Darooneh, A. H. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.07.077 · Cited by 17
Control of apoptosis by SMAR 1
Malik, M. Z., Alam, M. J., Ishrat, R., Agarwal, S. M., & Singh, R. K. B. (2016) · Molecular BioSystems · doi:10.1039/c6mb00525j · Cited by 17
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
