The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index; none of the 9 sources its claims cite is checked for support yet.
From time series to complex networks: the visibility graph
Open accessAbstract
In this work we present a simple and fast computational method, the visibility algorithm , that converts a time series into a graph. The constructed graph inherits several properties of the series in its structure. Thereby, periodic series convert into regular graphs, and random series do so into random graphs. Moreover, fractal series convert into scale-free networks, enhancing the fact that power law degree distributions are related to fractality, something highly discussed recently. Some remarkable examples and analytical tools are outlined to test the method's reliability. Many different measures, recently developed in the complex network theory, could by means of this new approach characterize time series from a new point of view.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper introduces the visibility algorithm, which maps a time series into a graph by connecting data points that can “see” each other without intermediate heights blocking the line of sight. It shows that periodic series yield regular graphs, random series yield random graphs with exponential degree tails, and fractal series yield scale-free visibility graphs.
Key findings
- Periodic time series map to regular graphs whose discrete degree distribution has peaks related to the series period; the example in Fig. 1 is a period-4 series.
- A random series of \(10^6\) data from \(U[0,1]\) produces a visibility graph whose degree distribution has an exponential tail, attributed to rare large values acting as hubs.
- Brownian motion visibility graphs are scale-free with \(P(k) \sim k^{-\alpha}\), \(\alpha = 2.00 \pm 0.01\), and show a Small-World effect with \(L(N) = 1.21 + 0.51\log(N)\).
- Conway series visibility graphs are scale-free with \(\alpha = 1.2 \pm 0.1\) and scale-invariant path length \(L(N) = 0.76 N^{0.38}\); a deterministic fractal example is also shown analytically to yield a power-law degree distribution.
Methods
- The visibility algorithm maps each time-series datum to a node and links two nodes if the straight line between their data values does not intersect any intermediate data height.
- The paper analyzes periodic series, a random series of \(10^6\) points from \(U[0,1]\), Brownian motion of \(10^6\) data, a Conway series of \(4 \cdot 10^6\) data, and a deterministic iterated fractal series.
- Main analyses include degree distributions \(P(k)\), mean path length \(L(N)\), and analytical recurrence relations for the deterministic fractal example.
Limitations
- The paper states that information is inevitably lost because the network structure is completely determined by the binary adjacency matrix; for example, periodic series \(T_1 = \{\ldots,3,1,3,1,\ldots\}\) and \(T_2 = \{\ldots,3,2,3,2,\ldots\}\) have the same visibility graph despite being quantitatively different.
- The paper states that it only tackles undirected graphs, while a directed version related to temporal axis direction is left for further work.
- The paper notes that the simple deterministic fractal example does not provide a general explanation of why fractality translates into power-law distributions, though it may stand as a generic way to deal with deterministic fractal series generated by iteration.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Own interpretation · 7 No basis given · 6 Own result · 4 Sources not found · 1 No full text of the sources · 1 Not checked yet · 1 Own method
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The degree distribution of this graph is formed by a finite number of peaks related to the series period, much in the vein of the Fourier Power Spectrum of a time series.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“( iii ) invariant under affine transformations of the series data: the visibility criterium is invariant under rescaling of both horizontal and vertical axis, as well as under horizontal and vertical translations (see figure 2).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The tail of this distribution fits quite well an exponential distribution, as expected.”
- Also stated in: § Resumen · p. 3 · plain
“random series convert into exponential random graphs”
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Resumen · p. 3 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In this letter we introduce a new tool in time series analysis: the visibility graph . This algorithm maps a time series into a network.”
- Also stated in: § Resumen · p. 1 · plain
“the visibility algorithm , that converts a time series into a graph.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Resumen · p. 1 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“( ii ) undirected: the way the algorithm is built up, there is no direction defined in the links.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“( i ) connected: each node sees at least its nearest neighbors (left and right).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This one is a power law P ( k ) ∼ k -α with α = 1 , 2 ± 0 , 1.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“that is, the degree distribution related to the C-nodes is a power law.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This one is a power law P ( k ) ∼ k -α with α = 2 , 00 ± 0 , 01.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is indeed due to these 'unlikely' large values (the hubs) that the tail of the degree distribution deviates from the Poisson distribution.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 6
- Probably not a substantial claim. 3
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“while the Brownian visibility graph seems to evidence the SmallWorld effect (right top figure 4) as L ( N ) ∼ log( N )”
- Also stated in: § Referencias · p. 12 · plain
“The best fitting provides a logarithmic scaling L ( N ) = 1 , 21 + 0 , 51log( N ). This network shows Small-World effect in addition to be scale-free.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § Referencias · p. 12 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“the Conway series shows in turn a self-similar relation (right bottom figure 4) of the shape L ( N ) ∼ N β”
- Also stated in: § Referencias · p. 12 · plain
“The best fitting provides a power law scaling L ( N ) = 0 , 76 N 0 , 38 . Then, this network is scale-invariant.”
plaincorrelationalSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § Referencias · p. 12 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“nodes A and B have typically the same degree.”
- Also stated in: § Resumen · p. 4 · plain
“The degree of A and B is the same as the right degree of C”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § Resumen · p. 4 · plain
In the paper
“Note that this summation agrees with the number of irreducible polynomials of degree at most n over the Galois field GF(2) [20]”
What the sources say
- Not checked — no full text of the sourcecites [20] K.H. Hicks, G.L. Mullen, and I. Sato, Distribution of irreducible polynomials over F 2 , in Finite Fields with Applications to Coding Theory, Cryptography and Related Areas (Oaxaca, 2001), 177-186, Springer, Berlin, 2002. source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“some other fractal series have been also studied (Q series [16], Stern series [17], Thue-Morse series [18], etc) with similar results.”
What the sources say
- Not checked — no full text of the sourcecites [16] D. Hofstadter, G¨ odel, Escher, Bach , New York: Vintage Books, pp. 137-138 (1980).
- Not matchedcites [17] M.A. Stern, J. Reine Angew. Math. , 55, pp. 193-220 (1858).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites [18] M.R. Schroeder, Fractals, Chaos, and Power Laws , New York: W. H. Freeman (1991).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“the method captures the hub repulsion phenomenon associated to fractal networks [8] and thus distinguishes scale free visibility graphs evidencing Small-World effect from those showing scale invariance.”
What the sources say
- Not matchedcites [8] C. Song, S. Havlin, H.A. Makse, Nat. Phys. 2 ,275 (2006).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The structure of the time series is conserved in the graph topology: periodic series convert into regular graphs, random series into random graphs and fractal series into scale-free graphs.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we may argue that the visibility graph can actually distinguish different types of fractality”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“In every case the algorithm captures the random nature of the series, and the particular shape of the degree distribution of the visibility graph is related to the particular random process [4].”
What the sources say
- Not matchedcites [4]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Not matched
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The resulting visibility graph has characteristics that reflect the equivalent time series temporal structure and can be used to identify trends.”
From PyIOmica: longitudinal omics analysis and trend identification (2020) · cites this paper as Lacasa et al., 2008
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Recent work on characterizing complex events focuses on using network/graph methodology that can capture non-linear behavior (Lacasa et al., 2008).”
From PyIOmica: longitudinal omics analysis and trend identification (2020) · cites this paper as Lacasa et al., 2008
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The challenges in capturing relationships and dependencies among emotions indicate the necessity for an architecture that is both easy to construct and preserves the structure of the underlying signal in its topology to improve both performance and interpretability [21], [22].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In VVG, edge directionality stems from the projection-based asymmetry between multidimensional vectors.When M = 1, vectors reduce to scalars, eliminating projections and making visibility symmetric, resulting in an undirected graph [22], [25].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Time series are transformed into networks that conserve their topology, and allow the identification of varying temporal structures.”
From PyIOmica: longitudinal omics analysis and trend identification (2020) · cites this paper as Lacasa et al., 2008
The cited source says what the claim attributes to it.
In the citing paper
“To this end, visibility graphs offer an effective means of representing sequential signals by connecting data points according to their value-based visibility, thereby preserving the underlying temporal structure while introducing geometric relationships [22], [23].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“The vector visibility graph (VVG) algorithm [25] extends the univariate visibility graph [22], [24] concept to multivariate time series data”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“This simple yet versatile transformation supports both scalar [22], [24] and vector representations [25], with applications spanning time series analysis and language processing [26], [27].”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“The natural visibility graph (NVG) algorithm [22] is a foundational method for mapping univariate (scalar) time series into graph networks.”
From Emotion Classification With Visibility Graphs (2025) · cites this paper as [22]
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,621
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
An Introduction to Probability Theory and its Applications.
Kingmán, J. F. C., & Feller, W. (1972) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344620 · Cited by 5,297
Bollobás, B. (1998) · Graduate texts in mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,867
An Introduction to Probability Theory.
Fristedt, B. E., & Moran, P. A. P. (1986) · Journal of the American Statistical Association · doi:10.2307/2288022 · Cited by 3,358
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances In Physics · doi:10.1080/00018730110112519 · Cited by 3,219
Research works printed but not linked: 2
- J Conway Some Crazy Sequences, 1988).
- MA Stern J Reine Angew Math 55, 193–220 (1858).
Cited by
Sorted by citations
Items 1,501–1,600 of 1,826
Liu, H., Tang, Q., & Liu, J. (2015) · Lecture notes in electrical engineering · doi:10.1007/978-3-662-46466-3_33
Splayed Recurrence Analysis of Iterated Dynamical Systems
Webber, C. L. (2016) · Springer proceedings in physics · doi:10.1007/978-3-319-29922-8_7
Mapeamento de Séries Financeiras em Redes Complexas
de Camargo, A. L., & Eisencraft, M. (2016) · Proceeding Series of the Brazilian Society of Computational and Applied Mathematics · doi:10.5540/03.2016.004.01.0039
Improve the estimation of Hurst exponents from visibility graph
Chen, Y., Wang, J., & Deng, B. (2016) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2016.7531377
A new network based feature-selection approach for hyperspcetral analysis
Xia, W., Pu, H., Dong, Z., et al. (2012) · doi:10.1109/whispers.2012.6874270
Other Types of Intermittency and Some Recent Advances in the Study of Chaotic Intermittency
Elaskar, S., & del Río, E. (2016) · Springer eBooks · doi:10.1007/978-3-319-47837-1_2
Chaos Based Quantitative Risk Assessment of Cardiac Dysfunction
Sarkar, R., Bhaduri, A., Bhaduri, S., et al. (2016) · Chemical Informatics · doi:10.21767/2470-6973.100018
Chaos Identification Based on Component Reordering and Visibility Graph
Zhu, S., & Gan, L. (2017) · Chinese Physics Letters · doi:10.1088/0256-307x/34/5/050501
John, R., & John, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.01206
Xiang, R., Zhang, J., & SMALL, M. P. (2010) · PolyU Institutional Research Archive (Hong Kong Polytechnic University)
Characterization of turbulent channel flows: from time-series to complex networks
Iacobello, G., Scarsoglio, S., & Ridolfi, L. (2017) · PORTO@Iris
Hyperspectral image target detection algorithm based on complex networks
Wu, C., Fan, S., & Xue, Y. (2017) · Applied Optics and Photonics China: Optical Spectroscopy and Imaging (AOPC) · doi:10.1117/12.2281626
Craciunescu, T., Murari, A., Peluso, E., et al. (2017) · European Conference on Circuit Theory and Design · doi:10.1109/ecctd.2017.8093302
A reserach on complex network model of field visibility of electric field in SF6 circuit breaker
Li, L., Wang, H., & Liu, X. (2017) · International Conference on Electric Power Equipment – Switching Technology · doi:10.1109/icepe-st.2017.8188942
Dynamical Complexities of Non-linear Physical and Biological Systems
Das, M. K., Saha, L. M., & Bhardwaj, R. (2017) · Indian Journal of Industrial and Applied Mathematics · doi:10.5958/1945-919x.2017.00011.1
Euler-Lagrange Network Dynamics
Wang, J., Wilson, R. C., & Hancock, E. R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78199-0_28
Characterizing the complexity of time series network graphs: A simplicial approachPreprint
Thyagu, N. N., Rao, N. V. K., Chutani, M., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.03154
Structural Correlations of Multiplex Networks
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0007
Opinion Dynamics and Game Theory
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0016
The Dynamics on Single Networks
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0003
Multilayer Networks in Nature, Society and Infrastructures
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0004 · Cited by 1
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0006
Synchronization, Non-linear Dynamics and Control
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0015
Classical Percolation, Generalized Percolation and Cascades
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0012
Visualización de series de tiempo en Python
Villarroel-Flores, R., Montiel, M. T., & Rodríguez‐Torres, E. E. (2018) · PÄDI Boletín Científico de Ciencias Básicas e Ingenierías del ICBI · doi:10.29057/icbi.v6i11.3021
Complex networks of the air passenger traffic in Mexican airports
Reyna, O. S. S., & Flores, I. (2017)
Effect of White Noise on the Structural Properties of Networks Arose from Time Series
Mallika, M., Drisya, G. V., Kumar, K. S. A., et al. (2018) · doi:10.1109/cetic4.2018.8530919
Comparative Analysis of Heart Rate Variability Signals
Pathak, K. P. P. D. K. P., & Singh, M. (2018)
Graph Theoretic Scenario in Period Doubling and Limit Cycle Circumstances in Two-Dimensional Maps
Dutta, T. K., Bhattacherjee, D., & Bhattacharjee, D. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-981-13-1951-8_36
Creation of language networks based on texts with using visibility graphs algorithms
Lande, D., & Dmytrenko, O. (2018) · Collection Information technology and security · doi:10.20535/2411-1031.2018.6.2.153486
Modified horizontal visibility graph and its application in turbulence
Tao, X., & Wu, H. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-1868
Quantification Analysis of Time Series Based on 2D Visibility State Plot
Zhao, C., Zeng, M., Wang, E., et al. (2018) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2018.8630751
Construction and Robustness of Interdependent Networks via Time Series and Visibility Graph
Li, K., Tu, L., Yang, Y., et al. (2019) · DEStech Transactions on Computer Science and Engineering · doi:10.12783/dtcse/msota2018/27520
Visibility graphs for robust harmonic similarity measures between audio spectra.
Yela, D. F., Stowell, D., & Sandler, M. B. (2019)
Econophysics: Bridges over a Turbulent Current
Chen, S., & Li, S.-P. (2011) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.1107.5373
Characterising submonolayer deposition via visibility graphs
Allen, D., Grinfeld, M., & Mulheran, P. A. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.121872
SpacePhaser: Phase Space Embedding Visual Analytics
Dang, T., & Nguyen, N. (2019) · IEEE Annual Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac.2019.10213
WITHDRAWN: Visibility graph analysis
Ramírez-Rojas, A., Sigalotti, L. D. G., Flores-Márquez, E. L., et al. (2019) · Elsevier eBooks · doi:10.1016/b978-0-12-814901-0.00014-6
Seethalakshmi, R. (2019) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-5225-9380-5.ch014
On the Evolutionary Neural Network Creation Using Native Visibility Graph
Tomaszek, L., & Zelinka, I. (2019) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2019.8789941
Classification of Base Station Time Series Based on Weighted Adjustable-Parameter LPVG
Li, L., Jiang, H., & Nai, H. (2019) · IEEE International Conference on Big Data Security on Cloud, IEEE International Conference on High Performance and Smart Computing, and IEEE International Conference on Intelligent Data and Security (BigDataSecurity/HPSC/IDS) · doi:10.1109/bigdatasecurity-hpsc-ids.2019.00032
Li, H., Yang, X., Yao, R., et al. (2019) · IEEE International Conference on Big Data Computing Service and Applications (BigDataService) · doi:10.1109/bigdataservice.2019.00023
Shaban, A., Amacha, N., Darwich, T., et al. (2019) · Acta Geophysica · doi:10.1007/s11600-019-00366-3
Detecção de eventos no Twitter através de Grafos de visibilidade natural
Tenorio, F. F. A., Chagas, E. T. C., Barros, P., et al. (2019) · doi:10.5753/courb.2019.7477
Nonlinear Scaling Behavior of Visible Volatility Duration for Financial Statistical Physics Dynamics
Zhang, B., Wang, J., Zhang, W., et al. (2019) · Computational Economics · doi:10.1007/s10614-019-09938-3
A Novel Time Series Forecasting Method Based on Fuzzy Visibility Graph
Zhou, J., Wang, J., Yu, F., et al. (2019) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-32591-6_28
Multilayer network methodologies for brain data analysis and modelling
Dimitri, G. M. (2019) · Apollo (University of Cambridge) · doi:10.17863/cam.50970
Shalalfeh, L., Bogdan, P., & JONCKHEERE, E. A. (2020) · IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT) · doi:10.1109/isgt45199.2020.9087753
Zamudio, G. S., Márquez, M. F., & José, M. V. (2020) · PLoS ONE · doi:10.1371/journal.pone.0235101
Quality Detection of Beef Based on Spectral Signal Quantile Graph Network Analysis Method
Liu, J., Xu, H., Bao, S.-Q., et al. (2020) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc49329.2020.9163947
Lande, D., Dmytrenko, O., Andriichuk, O., et al. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-58124-4_19
Myers, A., & Khasawneh, F. A. (2020) · doi:10.1115/detc2020-22441
Weighted Complex Network Based on Visibility Angle Measurement
Zeng, M., Xu, W., Zhao, C., et al. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189168
Bhaduri, S., Bhaduri, A., & Ghosh, D. C. (2020) · The European Physical Journal A · doi:10.1140/epja/s10050-020-00248-z
Tsiotas, D., Magafas, L., & Argyrakis, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.01487
Использование компьютерной визуализации в анализе кривых дыхания
Берестнева, О. Г., Анатольевна, О. И., & Лызин, И. А. (2020) · CyberLeninK (CyberLeninka)
Dutta, T. K., Bhattacherjee, D., & Bhattacharjee, D. (2020) · Advances in Mathematics Scientific Journal · doi:10.37418/amsj.10.1.22
Mesoscopic Analysis of Market-Based Electricity Price Fluctuation Modes
Ma, X., Li, Z., Xin, H., et al. (2020) · IEEE Sustainable Power and Energy Conference (iSPEC) · doi:10.1109/ispec50848.2020.9351237
Xie, W., Pang, M., Wu, W.-Z., et al. (2021) · arXiv (Cornell University)
Xu, L. (2019) · Deep Blue (University of Michigan)
Network-based characterization of passive-scalar plume dynamics in a turbulent boundary layer
Scarsoglio, S., Iacobello, G., Ridolfi, L., et al. (2019) · PORTO@Iris
From Permutations to Horizontal Visibility Patterns of Periodic Series
Muñoz, F. J., & Nuño, J. C. (2021) · International Conference on Time Series and Forecasting (ITISE) · doi:10.3390/engproc2021005009
Self-citationTime Series Classification Based on Complex Network
Qiu, K., Zhou, J., Cui, H., Chen, Z., Zheng, S., & Xuan, Q. (2021) · Big data management · doi:10.1007/978-981-16-2609-8_10
Observation of complex functional cortical patterns in brain cognitionPreprint
Gund, J., & Singh, R. K. B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.00310
Latent Network Construction for Univariate Time Series Based on Variational Auto-Encode
Sun, J., Wu, Z., Chen, S., Niu, H., & Tu, Z. (2021) · Entropy · doi:10.3390/e23081071
Fractal Features of Rumor Spread
Gao, X., & Liu, F. (2021) · International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE) · doi:10.1109/aemcse51986.2021.00252
From Chaotic Attractors to Complex Networks
Shimada, Y., & Ikeguchi, T. (2009) · IEICE Proceedings Series
Gund, J., Mishra, Y., Singh, R. K., & Mallick, B. N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.09224
Sets of numbers from complex networks perspective
Hernández, P. A. S. (2021) · doi:10.4995/thesis/10251/176015
DVS: Deep Visibility Series and its Application in Construction Cost Index ForecastingPreprint
Zhan, T., He, Y., Li, H., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04071
Gromov, V. A., Necheporenko, A., Gaisin, A., Volkov, I. I., & Diner, S. (2021) · Research Square · doi:10.21203/rs.3.rs-853110/v1
Qiao, H., Deng, Z., Gao, L., et al. (2021) · International Conference on Control, Automation and Information Sciences (ICCAIS) · doi:10.1109/iccais52680.2021.9624512
Characterizing Disease Spreading via Visibility Graph Embedding
Ni, K.-Y., Xu, J., Roach, S. M., et al. (2021) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata52589.2021.9671810
Multidimensional Visibility for Describing the Market Dynamics Around Brexit Announcements
Giuli, E. D., Flori, A., Lazzari, D., et al. (2021) · Springer eBooks · doi:10.1007/978-3-030-78965-7_27
Sujith, R. I., & Pawar, S. A. (2021) · Springer series in synergetics · doi:10.1007/978-3-030-81135-8_1
Deka, D., & Deka, B. (2021) · IEEE India Conference · doi:10.1109/indicon52576.2021.9691529
DC Serial Arc Fault Detection based on Visibility Graphs
Hussain, S., Waffler, D., Alnaggar, A., et al. (2021) · IEEE Vehicle Power and Propulsion Conference (VPPC) · doi:10.1109/vppc53923.2021.9699342
Evidence of Self-Organised Criticality in Time Series by the Horizontal Visibility Graph ApproachPreprint
Kaki, B., Farhang, N., & Safari, H. (2022) · Research Square · doi:10.21203/rs.3.rs-1434364/v1
A globális értékláncok hálózatelméleti vizsgálata
Vakhal, P. (2022) · doi:10.14267/phd.2022023
Chen, M., Ma, L., He, A., et al. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4007913
Myers, A., & Khasawneh, F. A. (2021) · doi:10.1115/1.0002054v
Novel computation methods for manufacturing process and machine component monitoring
Radhakrishnan, S. (2018) · doi:10.17760/d20316386
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0013
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0014
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0008
Critical Nodes Identification of Scientific Achievement Commercialization Network under k ‐Core
Weng, W., Li, Z., Qiu, Q., et al. (2022) · Complexity · doi:10.1155/2022/3148484
Novel Graph-Based Features for Bearing Fault Diagnosis: Two Aspects of Time Series Structure
Lee, S., Son, Y., & Choi, C. (2022) · PHM Society European Conference · doi:10.36001/phme.2022.v7i1.3314
A Step Forward to the Future Society
Aruka, Y. (2022) · Evolutionary economics and social complexity science · doi:10.1007/978-981-19-0937-5_1
Research on Establishing Network Algorithm of Complex Networks
唐, 绍. (2022) · Computer Science and Application · doi:10.12677/csa.2022.126156
Fractal Propagation Model of Network Rumors Based on SirPreprint
Gao, X., Liu, F. M., & Liu, C. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4128932
Complexity theory and dynamic characteristics of cognitive processes
Соловйов, В. М., Моісеєнко, Н. В., & Тарасова, О. Ю. (2020) · doi:10.31812/123456789/4143
Ків, А. Ю., Semerikov, S. O., Соловйов, В. М., et al. (2018) · doi:10.31812/123456789/2878
Investigate of Iran Recurrence Earthquakes by the NetworkPreprint
Rezaei, S., & Taghizadeh-Farahmand, F. (2022) · Research Square · doi:10.21203/rs.3.rs-1425179/v1
Мережнi мiри складностi у передбаченнi кризових явищ
Соловйов, В. М., & Чабаненко, Д. М. (2016) · doi:10.31812/0564/1208
Фолксономія соціально-економічних об’єктів в складних мережах засобами CorrRank
Соловйов, В. М., & Лук’янчук, О. С. (2014) · doi:10.31812/0564/1307
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
