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 301–400 of 1,826
Gao, Z., & Jin, N. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.01.025 · Cited by 33
Visibility graph analysis of very short-term heart rate variability during sleep
Hou, F., Li, F. W., Wang, J., & Yan, F. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.03.086 · Cited by 34
Visibility graph analysis for re-sampled time series from auto-regressive stochastic processes
Zhang, R., Zou, Y., Zhou, J., et al. (2016) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2016.04.031 · Cited by 33
Artameeyanant, P., Sultornsanee, S., & Chamnongthai, K. (2016) · SpringerPlus · doi:10.1186/s40064-016-3772-2 · Cited by 33
Small Target Detection in X-Band Sea Clutter Using the Visibility Graph
Chen, S., Feng, C., Huang, Y. P., Chen, X., & Li, F. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2022.3186283 · Cited by 32
Band Selection for Hyperspectral Imagery: A New Approach Based on Complex Networks
Xia, W., Wang, B., & Zhang, L. (2013) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2012.2236819 · Cited by 32
Can complex networks describe the urban and rural tropospheric O3 dynamics?
Carmona-Cabezas, R., Gómez-Gómez, J., Ariza-Villaverde, A. B., et al. (2019) · Chemosphere · doi:10.1016/j.chemosphere.2019.05.057 · Cited by 32
STCCD: Semantic trajectory clustering based on community detection in networks
Liu, C., & Guo, C. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113689 · Cited by 32
Spatiotemporal data analysis with chronological networks
Ferreira, L. N., Vega‐Oliveros, D. A., Cotacallapa, M., et al. (2020) · Nature Communications · doi:10.1038/s41467-020-17634-2 · Cited by 32
Zhou, J., Sun, M., Han, D., et al. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126218 · Cited by 32
An analysis of the global fuel-trading market based on the visibility graph approach
Hu, J., Zhang, Y., Wu, P., et al. (2021) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2021.111613 · Cited by 32
Comment on “Network analysis of human heartbeat dynamics” [Appl. Phys. Lett. 96, 073703 (2010)]
Zhao, D., & Li, X. (2010) · Applied Physics Letters · doi:10.1063/1.3458811 · Cited by 32
Characteristic exponents of complex networks
Nicosia, V., Domenico, M. D., & Latora, V. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/106/58005 · Cited by 32
Time series analysis of S&P 500 index: A horizontal visibility graph approach
Vamvakaris, M. D., Pantelous, A. A., & Zuev, K. M. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.01.010 · Cited by 32
Cross and joint ordinal partition transition networks for multivariate time series analysis
Guo, H., Zhang, J.-Y., Zou, Y., et al. (2018) · Frontiers of Physics · doi:10.1007/s11467-018-0805-0 · Cited by 32
Time series analysis in earthquake complex networks
Pastén, D., Czechowski, Z., & Toledo, B. A. (2018) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5023923 · Cited by 32
Zeng, J., & Tang, J. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3231959 · Cited by 32
Time reversibility during the ageing of materials
Böhmer, T., Gabriel, J. P., Costigliola, L., Kociok, J.-N., Hecksher, T., Dyre, J. C., & Blochowicz, T. (2024) · Nature Physics · doi:10.1038/s41567-023-02366-z · Cited by 31
Telesca, L., Lovallo, M., Aggarwal, S. K., et al. (2015) · Pure and Applied Geophysics · doi:10.1007/s00024-015-1034-9 · Cited by 31
Visibility graph network analysis of natural gas price: The case of North American market
Sun, M., Wang, Y., & Gao, C. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.06.051 · Cited by 31
Visibility graph analysis of Bitcoin price series
Liu, K., Weng, T., Gu, C., et al. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.122952 · Cited by 31
Identification of Alzheimer's EEG With a WVG Network-Based Fuzzy Learning Approach
Yu, H., Zhu, L., Cai, L., Wang, J., Liu, J., Wang, R., & Zhang, Z. (2020) · Frontiers in Neuroscience · doi:10.3389/fnins.2020.00641 · Cited by 31
Roy, S. S., Chatterjee, S., Roy, S., Bamane, P. D., Paramane, A., Rao, U. M., & Nazir, M. T. (2022) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2022.3167658 · Cited by 31
Econophysics: Bridges over a turbulent current
Chen, S., & Li, S.-P. (2011) · International Review of Financial Analysis · doi:10.1016/j.irfa.2011.07.001 · Cited by 30
Decoding cortical brain states from widefield calcium imaging data using visibility graph
Zhu, L., Lee, C. R., Margolis, D. J., & Najafizadeh, L. (2018) · Biomedical Optics Express · doi:10.1364/boe.9.003017 · Cited by 32
Accurate Indoor Localization Based on CSI and Visibility Graph
Wu, Z., Jiang, L., Jiang, Z., et al. (2018) · Sensors · doi:10.3390/s18082549 · Cited by 30
Ren, W., & Jin, N. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-05147-7 · Cited by 30
Wadhera, T., & Kakkar, D. (2020) · Neurological Research · doi:10.1080/01616412.2020.1726586 · Cited by 30
Contrasting chaotic with stochastic dynamics via ordinal transition networks
Olivares, F., Zanin, M., Zunino, L., & Pérez, D. G. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5142500 · Cited by 30
Iacobello, G., Ridolfi, L., & Scarsoglio, S. (2021) · Journal of Fluid Mechanics · doi:10.1017/jfm.2021.279 · Cited by 30
Li, X., Yang, D., Liu, X., & Wu, X. (2012) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2012.2221521 · Cited by 30
TANG, Q., Liu, J., & LIU, H. (2010) · Modern Physics Letters B · doi:10.1142/s0217984910023335 · Cited by 30
Mohammadpoory, Z., Nasrolahzadeh, M., Mahmoodian, N., & Haddadnia, J. (2019) · Measurement · doi:10.1016/j.measurement.2019.02.089 · Cited by 30
Identifying dynamical structures in the physical space of stochastic processes
Wosniack, M. E., Santos, M., Raposo, E. P., et al. (2019) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/125/20004 · Cited by 29
Li, Y., Yang, Y., Zheng, Q., Liu, Y., Wang, H., Song, S., & Zhao, P. (2023) · Medical & Biological Engineering & Computing · doi:10.1007/s11517-023-02914-y · Cited by 29
A Review of Visibility Graph Analysis
Azizi, H., & Sulaimany, S. (2024) · IEEE Access · doi:10.1109/access.2024.3401485 · Cited by 29
Raj, K. D., Lal, G. J., Gopalakrishnan, E. A., Sowmya, V., & Orozco‐Arroyave, J. R. (2024) · IEEE Access · doi:10.1109/access.2024.3416444 · Cited by 35
Modeling cardiorespiratory interaction during human sleep with complex networks
Long, X., Fonseca, P. M., Aarts, R. M., Haakma, R., & Foussier, J. (2014) · Applied Physics Letters · doi:10.1063/1.4902026 · Cited by 30
Canonical horizontal visibility graphs are uniquely determined by their degree sequence
Luque, B., & Lacasa, L. (2017) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2016-60164-1 · Cited by 29
Self-citationDetecting asynchrony of two series using multiscale cross-trend sample entropy
Wang, F., Zhao, W., & Jiang, S. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-05366-y · Cited by 29
A novel complex network-based deep learning method for characterizing gas–liquid two-phase flow
Gao, Z., Liu, M., Dang, W., & Cai, Q. (2020) · Petroleum Science · doi:10.1007/s12182-020-00493-3 · Cited by 30
Novel features for time series analysis: a complex networks approach
Silva, V. F., Silva, M. E., Ribeiro, P., et al. (2022) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-022-00826-3 · Cited by 29
Li, Z., Chen, Z., Wei, X., Gao, S. B., Ren, C., & Quek, T. Q. S. (2022) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/secon55815.2022.9918588 · Cited by 30
Visibility graph analysis of 2002–2011 Pannonian seismicity
Telesca, L., Lovallo, M., & Toth, L. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.08.048 · Cited by 29
From fuzzy recurrence plots to scalable recurrence networks of time series
Pham, T. D. (2017) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/118/20003 · Cited by 29
Telesca, L., Lovallo, M., Ramírez-Rojas, A., et al. (2014) · PLoS ONE · doi:10.1371/journal.pone.0106233 · Cited by 29
Ma, P., Liang, W., Zhang, H., et al. (2024) · Structural Health Monitoring · doi:10.1177/14759217241229999 · Cited by 28
Gao, Z., Yang, Y., Zhai, L., Dang, W., Yu, J.-L., & Jin, N. (2016) · Scientific Reports · doi:10.1038/srep20052 · Cited by 28
Geng, Z., Wang, Z., Hu, H., et al. (2018) · The Canadian Journal of Chemical Engineering · doi:10.1002/cjce.23319 · Cited by 28
Li, J., Shang, P., & Zhang, X. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-04950-6 · Cited by 28
Detection and classification of lean blow-out and thermoacoustic instability in turbulent combustors
Bhattacharya, C., De, S., Mukhopadhyay, A. K., et al. (2020) · Applied Thermal Engineering · doi:10.1016/j.applthermaleng.2020.115808 · Cited by 28
CLPVG: Circular limited penetrable visibility graph as a new network model for time series
Xuan, Q., Zhou, J., Qiu, K., Xu, D., Zheng, S., & Yang, X. (2022) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0048243 · Cited by 29
Nonlinear time series analysis of palaeoclimate proxy records
Marwan, N., Donges, J. F., Donner, R. V., & Eroglu, D. (2021) · Quaternary Science Reviews · doi:10.1016/j.quascirev.2021.107245 · Cited by 28
Zhou, Y., Xie, C., Wang, G., Zhu, Y., & Uddin, G. S. (2022) · Research in International Business and Finance · doi:10.1016/j.ribaf.2022.101846 · Cited by 30
Zhu, G., Li, Y., & Wen, P. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35139-6_18 · Cited by 28
A visibility graph averaging aggregation operator
Chen, S., Hu, Y. Q., Mahadevan, S., & Deng, Y. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.02.015 · Cited by 28
Financial risk assessment of imbalanced data based on nonlinear causal time-series network
Li, X., Li, W., Yu, X., Han, Z., & Jin, Q. (2024) · Information Processing & Management · doi:10.1016/j.ipm.2024.104025 · Cited by 27
On the existence of a long range correlation in the Geomagnetic Disturbance storm time (Dst) index
Banerjee, A., Bej, A., & Chatterjee, T. N. (2011) · Astrophysics and Space Science · doi:10.1007/s10509-011-0836-1 · Cited by 27
Visibility graph analysis of heart rate time series and bio-marker of congestive heart failure
Bhaduri, A., Bhaduri, S., & Ghosh, D. C. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.04.091 · Cited by 30
Plocoste, T., Carmona-Cabezas, R., Jiménez-Hornero, F. J., et al. (2020) · Atmospheric Pollution Research · doi:10.1016/j.apr.2020.08.027 · Cited by 27
Wearable Electromagnetic Belt for Steatotic Liver Detection Using Multivariate Energy Statistics
Rezaeieh, S. A., Brankovic, A., Janani, A. S., et al. (2020) · IEEE Access · doi:10.1109/access.2020.3035657 · Cited by 27
Hu, Y., & Xiao, F. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127029 · Cited by 27
Recurrence network analysis of experimental signals from bubbly oil-in-water flows
Gao, Z., Zhang, X.-W., Du, M., et al. (2012) · Physics Letters A · doi:10.1016/j.physleta.2012.12.017 · Cited by 27
Geometric signature of complex synchronisation scenarios
Feldhoff, J. H., Donner, R. V., Donges, J. F., et al. (2013) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/102/30007 · Cited by 27
Scarsoglio, S., Cazzato, F., & Ridolfi, L. (2017) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5003791 · Cited by 29
Mozaffarilegha, M., & Adeli, H. (2018) · Neuroscience Letters · doi:10.1016/j.neulet.2018.12.015 · Cited by 27
Geometric signature of complex synchronisation scenarios
Feldhoff, J. H., Donner, R. V., Donges, J. F., et al. (2013) · Publication Database PIK (Potsdam Institute for Climate Impact Research (PIK)) · Cited by 27
Convolutional neural network for screening of obstructive sleep apnea using snoring sounds
Li, R., Li, W., Yue, K., & Li, Y. (2023) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2023.104966 · Cited by 28
Multifractal Applications in Hydro-Climatology: A Comprehensive Review of Modern Methods
Vahab, S., & Adarsh, S. (2025) · Fractal and Fractional · doi:10.3390/fractalfract9010027 · Cited by 26
Chaos of radiative heat-loss-induced flame front instability
Kinugawa, H., Ueda, K., & Gotoda, H. (2016) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4941854 · Cited by 26
Graph Signal Processing of EEG signals for Detection of Epilepsy
Mathur, P., & Chakka, V. K. (2020) · International Conference on Signal Processing and Integrated Networks (SPIN) · doi:10.1109/spin48934.2020.9070326 · Cited by 26
Melo, D. D. F. P., Fadigas, I. D. S., & Pereira, H. B. D. B. (2020) · PLoS ONE · doi:10.1371/journal.pone.0240915 · Cited by 26
Wang, J., Liang, S., He, D., Wang, Y., Wu, Y., & Zhang, Y. (2020) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm49941.2020.9313232 · Cited by 26
Background PM10 atmosphere: In the seek of a multifractal characterization using complex networks
Plocoste, T., Carmona-Cabezas, R., Jiménez-Hornero, F. J., & de Ravé, E. G. (2021) · Journal of Aerosol Science · doi:10.1016/j.jaerosci.2021.105777 · Cited by 27
Huang, M., Sun, Z., Donner, R. V., et al. (2021) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0038876 · Cited by 26
Analysis of stock market based on visibility graph and structure entropy
Zhu, J., & Wei, D. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126036 · Cited by 26
Mohammadpoory, Z., Nasrolahzadeh, M., & Amiri, S. A. (2023) · Multimedia Tools and Applications · doi:10.1007/s11042-023-15681-7 · Cited by 28
Ren, W., & Jin, Z. (2023) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2023.114170 · Cited by 26
Volatility behavior of visibility graph EMD financial time series from Ising interacting system
Zhang, B., Wang, J., & Fang, W. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.03.057 · Cited by 26
Wearing a Wetsuit Alters Upper Extremity Motion during Simulated Surfboard Paddling
Nessler, J. A., Silvas, M. N., Carpenter, S., et al. (2015) · PLoS ONE · doi:10.1371/journal.pone.0142325 · Cited by 26
Network structure of turbulent premixed flames
Singh, J., Vishwanath, R. B., Chaudhuri, S., et al. (2017) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4980135 · Cited by 26
Visibility graph approach to the analysis of ocean tidal records
Telesca, L., Lovallo, M., & Pierini, J. O. (2012) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2012.06.003 · Cited by 26
From Complex Networks to Time Series Analysis and Viceversa: Application to Metabolic Networks
Strozzi, F., Jose, Z. C., Karmen, P., Bono, F., & Eugenio, G. T. (2009) · doi:10.2788/25588 · Cited by 24
Supriya, S., Supriya, Siuly, et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46922-5_5 · Cited by 25
Analysis of heart rate signals during meditation using visibility graph complexity
Nasrolahzadeh, M., Mohammadpoory, Z., & Haddadnia, J. (2018) · Cognitive Neurodynamics · doi:10.1007/s11571-018-9501-5 · Cited by 25
Time series classification based on complex network
Li, H., Jia, R., & Wan, X. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116502 · Cited by 25
Central apnea detection in premature infants using machine learning
Varisco, G., Peng, Z. Q., Kommers, D. R., Zhan, Z. Z., Cottaar, W., Andriessen, P., Long, X., & van Pul, C. (2022) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2022.107155 · Cited by 25
Kan, C., Ye, Z., Zhou, H., et al. (2022) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2022.104388 · Cited by 25
Ning, S., Ren, Y., & Wu, Y. (2023) · Journal of the Brazilian Society of Mechanical Sciences and Engineering · doi:10.1007/s40430-022-03913-0 · Cited by 25
Automatic snoring detection using a hybrid 1D–2D convolutional neural network
Li, R., Li, W., Yue, K., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-41170-w · Cited by 25
Analysing epileptic EEGs with a visibility graph algorithm
Zhu, G., Li, Y., & Wen, P. P. (2012) · International Conference on Biomedical Engineering and Informatics (BMEI) · doi:10.1109/bmei.2012.6513212 · Cited by 25
Memory and betweenness preference in temporal networks induced from time series
Weng, T., Zhang, J., SMALL, M. P., Zheng, R., & Hui, P. (2017) · Scientific Reports · doi:10.1038/srep41951 · Cited by 25
Rong, L., & Shang, P. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4120-6 · Cited by 25
Zeng, M., Zhao, C., & Meng, Q. (2019) · IEEE Access · doi:10.1109/access.2019.2890895 · Cited by 26
Iacobello, G., Marro, M., Ridolfi, L., et al. (2019) · Physical Review Fluids · doi:10.1103/physrevfluids.4.104501 · Cited by 25
Quasiperiodic Graphs: Structural Design, Scaling and Entropic Properties
Luque, B., Ballesteros, F., Núñez, Á. M., et al. (2013) · Cited by 25
Self-citationLimited penetrable visibility graph from two-phase flow for investigating flow pattern dynamics
Gao, Z., Hu, L.-D., Zhou, T., & Jin, N. (2013) · Acta Physica Sinica · doi:10.7498/aps.62.110507 · Cited by 25
Corradini, F., Gerosa, F., Gori, M., Lucheroni, C., Piangerelli, M., & Zannotti, M. (2025) · Neural Networks · doi:10.1016/j.neunet.2025.108269 · Cited by 47
Temporal dynamics of streamflow: application of complex networks
Han, X., Sivakumar, B., Woldmeskel, F. M., et al. (2018) · Geoscience Letters · doi:10.1186/s40562-018-0109-8 · Cited by 24
Scarsoglio, S., Cazzato, F., & Ridolfi, L. (2017) · PORTO Publications Open Repository TOrino (Politecnico di Torino) · Cited by 24
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
