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,301–1,400 of 1,826
Clustering 1-Dimensional Periodic Network Using Betweenness Centrality
Fu, N., & Suppakitpaisarn, V. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21786-4_11 · Cited by 2
Predicting Behavior from Cortical Activity Recorded through Widefield Transcranial Imaging
Zhu, L., Lee, C. R., Margolis, D. J., et al. (2017) · Conference on Lasers and Electro-Optics · doi:10.1364/cleo_at.2017.atu3b.1 · Cited by 2
The Feature Extraction Method of EEG Signals Based on the Loop Coefficient of Transition Network
Liu, M., Meng, Q., Zhang, Q., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63312-1_63 · Cited by 2
Interdependent Multilayer Networks
Bianconi, G. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198753919.003.0011 · Cited by 2
Visibility Graph Network Analysis of Air Quality Data
Fan, X. (2018) · International Journal of Environmental Monitoring and Analysis · doi:10.11648/j.ijema.20180603.15 · Cited by 2
Azimuthal Anisotropy in High-Energy Nuclear Collision: An Approach Based on Complex Network Analysis
Bhaduri, S., & Ghosh, D. (2018) · Advances in High Energy Physics · doi:10.1155/2018/8347408 · Cited by 2
Analysing Epileptic EEG Signals Based on Improved Transition Network
Li, Y., Guo, Y., Meng, Q., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22808-8_16 · Cited by 2
How to transform the seismic time series to a graph?
Wang, Z., Zhang, B., & Gao, J. (2019) · Second International Meeting for Applied Geoscience & Energy · doi:10.1190/segam2019-3215740.1 · Cited by 2
Bi, Z., Ma, Y., Yang, X., et al. (2019) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.3825 · Cited by 2
Wang, C., Liu, M., Wang, X., et al. (2020) · doi:10.1145/3403782.3403810 · Cited by 2
Graph Spectral Embedding for Parsimonious Transmission of Multivariate Time Series
Yao, L., & Bendich, P. L. (2020) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero47225.2020.9172767 · Cited by 2
Fractals and complex networks applied to earthquakes
Pastén, D. (2020) · Elsevier eBooks · doi:10.1016/b978-0-12-820513-6.00021-7 · Cited by 2
Análise de grafos de visibilidade do mercado brasileiro de soja, milho e carne de frango
Nunes, J. E. D. O., da Silva, J. M., Araújo, L. D. S., et al. (2021) · Research Society and Development · doi:10.33448/rsd-v10i1.11478 · Cited by 2
An Approach of LPI Radar Signal Detection Based on Visibility Graph
Jingyi, L., Wan, T., & Tang, B. (2020) · IEEE International Conference of Safe Production and Informatization (IICSPI) · doi:10.1109/iicspi51290.2020.9332200 · Cited by 2
Visibility-graphlet approach to the output series of a Hodgkin–Huxley neuron
Zhao, Y., Gu, C., & Yang, H. (2021) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0018359 · Cited by 2
Improved tests for non-linearity using network-based statistics and surrogate data
Mallika, M., Asokan, K., Kumar, K. S. A., et al. (2021) · Pramana · doi:10.1007/s12043-021-02181-2 · Cited by 2
Potential grouping of nodes induced by higher-order structures in complex networks
Maletić, S., Andjelković, M., & Rajković, M. (2021) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0069444 · Cited by 2
Shang, B., & Shang, P. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.112295 · Cited by 2
Detection of Epilepsy Using Graph Signal Processing of EEG Signals with Three Features
Meena, H. K., Sharma, R., Tailor, A., et al. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-1520-8_46 · Cited by 2
Babič, M., Wangyao, P., Šter, B., et al. (2022) · FME Transaction · doi:10.5937/fme2203393b · Cited by 2
Assessment of time irreversibility in a time series using visibility graphs
Andrzejewska, M., Zebrowski, J. J., Rams, K., et al. (2022) · Frontiers in Network Physiology · doi:10.3389/fnetp.2022.877474 · Cited by 2
An empirical study on network conversion of stock time series based on STL method
Tian, F., Wang, D., Wu, Q., et al. (2022) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0089059 · Cited by 2
Hydrophobicity Grade Detection of Polymeric Insulator Using Image Visibility Graph
Roy, S. S., Paramane, A., Singh, J., et al. (2022) · IEEE International Conference on Condition Assessment Techniques in Electrical Systems (CATCON) · doi:10.1109/catcon56237.2022.10077665 · Cited by 2
Complex network of eye movements during rapid automatized naming
Wang, H., Liu, F., & Yu, D. (2023) · Frontiers in Neuroscience · doi:10.3389/fnins.2023.1024881 · Cited by 2
Xiao, Y., Li, W., Wang, J., Wu, X., & Sheng, B. (2023) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2023.3283534 · Cited by 2
Multiplex Temporal Networks for Rapid Mental Workload Classification
Teymourlouei, A., Stone, J., Gentili, R. J., et al. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-43075-6_18 · Cited by 2
Anomaly detection of EEG in patients with epilepsy based on graph deviation network
Chen, M., Liu, C., Gao, H., Tao, H., & Lin, S. (2023) · International Conference on Computer Information Science and Application Technology (CISAT) · doi:10.1117/12.3004116 · Cited by 2
PPG-based cf-PWV Estimation Using Visibility Graph Image Representation and Transfer Learning
Vargas, J. M., Bahloul, M. A., & Laleg‐Kirati, T. (2023) · doi:10.1109/ieeeconf58974.2023.10405056 · Cited by 2
Guo, W., Sun, X., Lv, D., et al. (2024) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0187023 · Cited by 2
A Tool to Nowcast Tourist Overnight Stays with Payment Data and Complementary Indicators
Crispino, M., & Mariani, V. (2024) · Italian Economic Journal · doi:10.1007/s40797-024-00266-6 · Cited by 2
Use of Visibility Graphs for the Early Detection of DoS Attacks
Lopes, J., Pinto, P., Partida, A., & Pinto, A. (2024) · IEEE International Conference on Cyber Security and Resilience (CSR) · doi:10.1109/csr61664.2024.10679430 · Cited by 2
The Feature Extraction Method of EEG Signals Based on Transition Network
Liu, M., Meng, Q., Zhang, Q., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59081-3_57 · Cited by 2
Epileptic Seizure Detection using DWT Based Weighted Visibility Graph
Cai, L., Wang, J., Lu, M., et al. (2018) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2018.8630498 · Cited by 2
Research of EEG Signal Based on Permutation Entropy and Limited Penetrable Visibility Graph
Xu, H., Dai, J., Li, J., et al. (2018) · International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) · doi:10.1109/cisp-bmei.2018.8633121 · Cited by 2
Esperon-Miguez, M., Uriondo, A., Rodriguez, J., & Luque, B. (2019) · International Journal of Prognostics and Health Management · doi:10.36001/ijphm.2019.v10i1.2745 · Cited by 2
Self-citationAn improved 3D shape visibility graph with application to mesh segmentation
Fotopoulou, F., & Psarakis, E. Ζ. (2020) · Signal Processing Image Communication · doi:10.1016/j.image.2020.115980 · Cited by 2
da Silva, J. M., Araújo, L. D. S., Stošić, T., et al. (2020) · Research Society and Development · doi:10.33448/rsd-v9i9.6276 · Cited by 2
Construction of Multiplex Muscle Network for Precision Pinch Force Control
Lv, Y., Wie, N., & Li, K. (2020) · Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society · doi:10.1109/embc44109.2020.9175447 · Cited by 2
Randomness criteria in binary visibility graph perspectivePreprint
Ahadpour, S., & Sadra, Y. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.2189 · Cited by 2
Heart Rate Variability Analysis During Normal and Hypertensive Pregnancy.
Puente, E. (2011) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · doi:10.34626/95tj-9f66 · Cited by 2
Efficient On-line Computation of Visibility GraphsPreprint
Yela, D. F., Thalmann, F., Nicosia, V., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.03204 · Cited by 2
Yu, J., Gu, H., Chi, B., et al. (2020) · International Journal of Design & Nature and Ecodynamics · doi:10.18280/ijdne.150616 · Cited by 1
Investigating the searching behavior of Sino-U.S. relations in China based on complex network
Chen, J., Wang, L., & Weng, W. (2023) · Frontiers in Physics · doi:10.3389/fphy.2023.1021565 · Cited by 1
Generalized relational tensors for chaotic time series
Gromov, V. A., Beschastnov, Y., & Tomashchuk, K. K. (2023) · PeerJ Computer Science · doi:10.7717/peerj-cs.1254 · Cited by 1
On the divisors of natural and happy numbers: a study based on entropy and graphs
Mayer, B., & Monteiro, L. H. A. (2023) · AIMS Mathematics · doi:10.3934/math.2023679 · Cited by 1
Analysis of the Sars-COVID 19 trend: from time series to visibility graphs
Simone, A., Cesaro, A., & Esposito, G. (2023) · Global NEST International Conference on Environmental Science & Technology · doi:10.30955/gnc2023.00202 · Cited by 1
Zhang, H., Wang, H., Liang, X., et al. (2023) · The Journal of the Acoustical Society of America · doi:10.1121/10.0020907 · Cited by 1
Generalized limited penetrable vector visibility graph
Ren, W., Jin, N., & Jin, Z. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ad0408 · Cited by 1
Mari, C., & Baldassari, C. (2024) · Neural Computing and Applications · doi:10.1007/s00521-024-10202-5 · Cited by 1
Yin, Y., Wang, X., Wang, W., et al. (2024) · Fluctuation and Noise Letters · doi:10.1142/s0219477525500129 · Cited by 1
Telesca, L., & Czechowski, Z. (2024) · Mathematics · doi:10.3390/math12203197 · Cited by 1
Zhang, D., Li, X., Ling, L., et al. (2025) · Computational Economics · doi:10.1007/s10614-024-10832-w · Cited by 1
Niu, H., Mu, T., Wang, Y., et al. (2025) · Applied Sciences · doi:10.3390/app15063015 · Cited by 1
Complex Network Method for Inferring Well Interconnectivity in Hydrocarbon Reservoirs
Mayoral-Villa, M., Godínez, F. A., González-Guevara, J. A., et al. (2025) · Fluids · doi:10.3390/fluids10040095 · Cited by 1
Classification of mammograms: Comparing a graphical to a geometrical approach
Ghosh, A., Ranjan, P., Shrivastav, K. D., & Janardhanan, R. (2025) · EngMedicine · doi:10.1016/j.engmed.2025.100072 · Cited by 1
Group detection in energy commodity markets through manifold-informed Wasserstein barycenter
Mari, C., Laureti, T., & Baldassari, C. (2025) · Quality & Quantity · doi:10.1007/s11135-025-02147-1 · Cited by 1
Modeling Parking Occupancy Using Algorithm of 3D Visibility Network
Babič, M., Šter, B., Hluchý, L., et al. (2025) · IEEE Access · doi:10.1109/access.2025.3562796 · Cited by 1
Network dynamics and suppression of spray combustion instability in a backward-facing step combustor
Kato, K., Gotoda, H., Nabae, Y., et al. (2025) · Physical Review Applied · doi:10.1103/zhkg-c3kh · Cited by 1
Supriya, S., Sidnal, N. S., Jan, T., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-5597-7_21 · Cited by 1
Time Series Forecasting Based on Temporal Networks Evolution and Dynamic Constraints
Peng, Y., Li, H., & Han, X. (2025) · IEEE Access · doi:10.1109/access.2025.3577499 · Cited by 1
Complex network analysis of zebrafish locomotion based on time series and visibility graphs
王, Z. 震. W., & Gao, J. (2025) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0253756 · Cited by 1
Zhang, Y., Li, Z., Lu, Y., et al. (2025) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2025.3579556 · Cited by 1
Liu, X., Li, Y., & Wang, H. (2025) · International World Wide Web Conference (WWW) · doi:10.1145/3701716.3715550 · Cited by 1
Life-Threatening Ventricular Arrhythmia Identification Based on Multiple Complex Networks
Cai, Z., Yu, M.-L., Yu, J., Han, X., Li, J., & Qu, Y. (2025) · Electronics · doi:10.3390/electronics14152921 · Cited by 1
Topological Indices Based Vector Representation of Graphs
Vandana, P., Mohan, N., Ashok, N., et al. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-89983-6_1 · Cited by 1
On the application of visibility graphs in the spectral domain for speaker recognition
Bocaccio, H., Pérez, S. I., Romance, M., et al. (2025) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2025.134868 · Cited by 1
Zhu, W., Hu, G., Song, J., et al. (2025) · IET Radar Sonar & Navigation · doi:10.1049/rsn2.70051 · Cited by 1
Azizi, H., Amini, M. S., Sulaimany, S., & Mafakheri, A. (2025) · Scientific Reports · doi:10.1038/s41598-025-17760-1 · Cited by 2
Hu, J., Gao, D., Wang, L., et al. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.117161 · Cited by 1
Ozdes, C., Ediger, V. Ş., & Eroglu, D. (2025) · Humanities and Social Sciences Communications · doi:10.1057/s41599-025-04904-x · Cited by 1
Zhang, W., & Tao, J. (2025) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2025.3634650 · Cited by 3
Snow Phase Change Detection In C-Band Sar Time Series Using Horizontal Visibility Graphs
Beltramone, G., Frery, A. C., Scavuzzo, C. M., et al. (2025) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss55030.2025.11243921 · Cited by 1
Contagion risk prediction with Chart Graph Convolutional Network: Evidence from Chinese stock market
Chen, Z., Zhang, W., & Yao, Y. (2025) · Emerging Markets Review · doi:10.1016/j.ememar.2025.101426 · Cited by 2
Complexity analyses of geomagnetic and solar activity indices time series
Javaherian, M., Mollaei, S., Zolghadr, N., Moradpour, H., & Yousefzadeh, M. (2025) · Scientific Reports · doi:10.1038/s41598-025-27654-x · Cited by 1
An analytics framework for graph-based anomaly detection in healthcare time series
Okano, É. Y., Aloise, D., & Nascimento, M. C. V. (2026) · Healthcare Analytics · doi:10.1016/j.health.2026.100447 · Cited by 1
Electricity price spike forecasting via multivariate adaptive visibility graph neural networks
Bao, T., Mahdavi, N., McCarthy, C. D., & Rezazadegan, D. (2026) · Electric Power Systems Research · doi:10.1016/j.epsr.2025.112695 · Cited by 1
Jatoliya, S., Savaj, P., Baraiya, N. A., et al. (2026) · Physics of Fluids · doi:10.1063/5.0310103 · Cited by 1
Angle difference threshold graph induced complex network for data series analysis
Yan, H., Zhu, F., & Zheng, W. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.114794 · Cited by 1
Cheng, X., Gong, Y., Yan, C., et al. (2026) · Annals of the New York Academy of Sciences · doi:10.1111/nyas.70268 · Cited by 1
Díaz, L. R. M., Pinzon-Arenas, J. O., Constable, P. A., Lee, I., Loh, L., Thompson, D., & Posada-Quintero, H. F. (2026) · Bioengineering · doi:10.3390/bioengineering13040446 · Cited by 1
Six-sigma approach-based visibility graphs
Ferenczi, M., Kummer, A., & Abonyi, J. (2026) · Scientific Reports · doi:10.1038/s41598-026-48718-6 · Cited by 1
Bonn EEG as Graphs: Structural vs. Recurrence Networks for Tiny-Data Seizure Screening
Srivastava, E., Ujjain, S., Gandhi, T. K., & Kumar, S. (2026) · National Conference on Communications · doi:10.1109/ncc68160.2026.11478944 · Cited by 1
Optimizing-Time Series Imputation with Data Quality
Huang, F., Li, S. Y., Peng, J., et al. (2026) · Applied Sciences · doi:10.3390/app16146837 · Cited by 1
Allouche, J. (2012) · Kyoto University Research Information Repository (Kyoto University) · Cited by 1
Prediction of Epileptic Disease Based on Complex Network
Jiang, Z., Hu, Y., & Hao, C. (2013) · International Symposium on Computational Intelligence and Design · doi:10.1109/iscid.2013.211 · Cited by 1
Fractal characterization of an after-sales spare parts supply chain in telecom industry
Matamoros, O. M., Flores-Cadena, M., Padilla, R. T., et al. (2011) · doi:10.5897/ijps11.198 · Cited by 1
Lacasa, L. (2011) · Astrophysics and Space Science · doi:10.1007/s10509-011-0926-0 · Cited by 1
Self-citationA Network Technique Based Feature Extraction Method For Remote Sensing Images
Xia, W. (2015) · doi:10.2991/eers-15.2015.19 · Cited by 1
The Time Series Pattern of Traffic Flow on an Accident Section
Peng, F., Guo, J., & Xu, Q. (2014) · Advances in intelligent systems and computing · doi:10.1007/978-3-642-54927-4_108 · Cited by 1
Zeng, M., Ma, W., Meng, Q., et al. (2016) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2016.7578754 · Cited by 1
Visibility graph analysis of fluid flow signals
Gao, Z., & Ji, L. (2012) · IEEE International Conference on Advanced Computational Intelligence · doi:10.1109/icaci.2012.6463119 · Cited by 1
A threat assessment method based on prioritized visibility graph ordered weighted averaging operator
Zhou, D., Pan, Q., Li, X., et al. (2016) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2016.7832102 · Cited by 1
Network-based landscape of research strengths of universities in Mainland China
Liu, Z., Xiao, Q., Zhan, Q., et al. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.02.058 · Cited by 1
The Simplicial Characterisation of TS Networks: Theory and Applications
Gupte, N., Thyagu, N. N., & Chutani, M. (2017) · Lecture notes in networks and systems · doi:10.1007/978-3-319-52621-8_25 · Cited by 1
Scale-Free Networks Out of Multifractal Chaos
Budroni, M. A., & Pastor‐Satorras, R. (2017) · Communications in computer and information science · doi:10.1007/978-3-319-57711-1_1 · Cited by 1
Liu, H., Meng, Q., Zhang, Q., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63309-1_30 · Cited by 1
Multidimensional Time Series Analysis of Financial Markets Based on the Complex Network Approach
Li, Y., Yang, D., & Li, X. (2017) · Journal of Mathematical Finance · doi:10.4236/jmf.2017.73039 · Cited by 1
Characterisation of wireless network traffic: Fractality and stationarity
Mukherjee, S., Ray, R., Khondekar, M. H., et al. (2017) · International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) · doi:10.1109/icrcicn.2017.8234485 · Cited by 1
Telesca, L. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-813138-1.00004-3 · Cited by 1
SOMA Network Model Based on Native Visibility Graph
Tomaszek, L., & Zelinka, I. (2017) · MENDEL · doi:10.13164/mendel.2017.1.049 · Cited by 1
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
