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 901–1,000 of 1,826
Geng, B., Wang, H., Shen, X., et al. (2024) · Physical review. E · doi:10.1103/physreve.110.024205 · Cited by 6
Qun, Z., Xie, C., Weng, Z., et al. (2024) · Decision Support Systems · doi:10.1016/j.dss.2024.114309 · Cited by 6
Characterization and visualization of gas–liquid two-phase flow based on wire-mesh sensor
Li, M., Wang, R., Li, W. H., et al. (2024) · Measurement · doi:10.1016/j.measurement.2024.116265 · Cited by 6
Time-reversibility in seismic sequences: Application to the seismicity of Mexican subduction zone
Telesca, L., Flores-Márquez, E. L., & Ramírez-Rojas, A. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.11.064 · Cited by 6
Kim, K., & Song, J. W. (2020) · IEEE Access · doi:10.1109/access.2020.3037240 · Cited by 6
Multi-scale transition matrix approach to time series
Yuan, Q., Semba, S., Zhang, J., et al. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126116 · Cited by 6
Wadhera, T., & Kakkar, D. (2021) · Physical and Engineering Sciences in Medicine · doi:10.1007/s13246-021-01045-8 · Cited by 6
Giuli, M. E. D., Flori, A., Lazzari, D., et al. (2021) · Quantitative Finance · doi:10.1080/14697688.2021.1970212 · Cited by 6
The North–South Asymmetry of Sunspot Relative Numbers Based on Complex Network Technique
Xu, H., Fei, Y., Li, C., et al. (2021) · Symmetry · doi:10.3390/sym13112228 · Cited by 6
Nomi, Y., Gotoda, H., Fukuda, S., et al. (2021) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0070526 · Cited by 6
Interrelation measurement based on the multi-layer limited penetrable horizontal visibility graph
Wang, M., Hua, C., Zhu, M., et al. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.112422 · Cited by 6
Multiscale online-horizontal-visibility-graph correlation analysis of financial market
Han, M., Fan, Q., & Ling, G. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.128195 · Cited by 6
Agostini, L. M., & Leschziner, M. A. (2022) · Physics of Fluids · doi:10.1063/5.0123119 · Cited by 6
Ramírez-Rojas, A., Flores-Márquez, E. L., & Vargas, C. A. (2023) · Entropy · doi:10.3390/e25050799 · Cited by 6
Singh, M. K., Chaube, S., Pant, S., Singh, S. K., & Kumar, A. (2023) · Decision Analytics Journal · doi:10.1016/j.dajour.2023.100253 · Cited by 6
Investigation of the Global Stock Trading Based on Visibility Graph and Entropy Weight Method
Wang, L., Hu, J., & Hu, Y. (2023) · Fluctuation and Noise Letters · doi:10.1142/s0219477523500505 · Cited by 6
Surapaneni, S. P., & Manikandan, M. S. (2023) · International Conference on Electronics, Computers and Artificial Intelligence (ECAI) · doi:10.1109/ecai58194.2023.10194077 · Cited by 6
Zhu, Y., Hou, H., Zhang, M., et al. (2023) · Environment Development and Sustainability · doi:10.1007/s10668-023-04057-4 · Cited by 6
Liu, F., Wang, H., Zhao, X., et al. (2024) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2024.106148 · Cited by 6
Yao, W. (2024) · Physical review. E · doi:10.1103/physreve.109.054104 · Cited by 6
Wang, F., Meng, Q., Zhou, W., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39479-9_42 · Cited by 6
DETECTING CHAOS TIME SERIES VIA COMPLEX NETWORK FEATURE
TANG, Q., Zhao, J., & HU, T. (2011) · Modern Physics Letters B · doi:10.1142/s0217984911027133 · Cited by 6
Complex brain networks using Visibility Graph synchronization
Sengupta, A., Routray, A., & Kar, S. (2013) · IEEE India Conference · doi:10.1109/indcon.2013.6726126 · Cited by 6
Artameeyanant, P., Sultornsanee, S., & Chamnongthai, K. (2015) · International Conference on Knowledge and Smart Technology · doi:10.1109/kst.2015.7051485 · Cited by 6
Bridge time series and complex networks with a frequency-degree mapping algorithm
Yang, D., & Li, X. (2012) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2012.6272191 · Cited by 6
CHARACTERIZATION OF HORIZONTAL GAS–LIQUID TWO-PHASE FLOW USING MARKOV MODEL-BASED COMPLEX NETWORK
Hu, L.-D., Jin, N., & Gao, Z. (2013) · International Journal of Modern Physics C · doi:10.1142/s0129183113500289 · Cited by 6
Gómez-Cabrero, D., & Tegner, J. N. (2017) · Current Opinion in Systems Biology · doi:10.1016/j.coisb.2017.05.001 · Cited by 7
Melo, D. D. F. P., Fadigas, I. D. S., & Pereira, H. B. D. B. (2017) · Applied Network Science · doi:10.1007/s41109-017-0052-1 · Cited by 6
Specific Emitter Identification Based on Visibility Graph Entropy
Zhu, S., & Gan, L. (2018) · Chinese Physics Letters · doi:10.1088/0256-307x/35/3/030501 · Cited by 6
Relative asynchronous index: a new measure for time series irreversibility
Yang, P., & Shang, P. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4275-1 · Cited by 6
A New Epileptic Seizure Detection Method Based on Fusion Feature of Weighted Complex Network
Zhang, H., Meng, Q., Liu, M., et al. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-92537-0_94 · Cited by 6
Clan-Model of Particle Production Process-Revisited in Chaos-based Complex Network Scenario
Bhaduri, S., Bhaduri, A., & Ghosh, D. C. (2018) · Physics of Particles and Nuclei Letters · doi:10.1134/s1547477118040040 · Cited by 6
Dong, K., Che, H., & Zou, Z. G. (2019) · Entropy · doi:10.3390/e21101008 · Cited by 6
Complex Network Construction of Univariate Chaotic Time Series Based on Maximum Mean Discrepancy
Sun, J. (2020) · Entropy · doi:10.3390/e22020142 · Cited by 6
Complex Network Time Series Analysis of a Macroeconomic Model
Antoniades, I. P., Stavrinides, S. G., Hanias, M. P., et al. (2020) · Springer proceedings in complexity · doi:10.1007/978-3-030-35441-1_13 · Cited by 6
Liu, J., Yu, Z., Leung, Y., Fung, T., & Zhou, Y. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0003884 · Cited by 6
Qiao, H., Deng, Z., Li, H., Hu, J., Song, Q., & Xia, C. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2021.126435 · Cited by 6
Analysis of precipitation characteristics in Shanghai based on the visibility graph algorithm
Cao, R., Deng, Z., & Xu, J. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127227 · Cited by 6
Individual-specific networks for prediction modelling – A scoping review of methods
Gregorich, M., Melograna, F., Sunqvist, M., Michiels, S., Steen, K. V., & Heinze, G. (2022) · BMC Medical Research Methodology · doi:10.1186/s12874-022-01544-6 · Cited by 6
Lal, G. J., Gopalakrishnan, E. A., & Govind, D. (2022) · Circuits Systems and Signal Processing · doi:10.1007/s00034-022-02103-6 · Cited by 7
Investigating Graph-based Features for Speech Emotion Recognition
Pentari, A., Kafentzis, G. P., & Tsiknakis, M. (2022) · IEEE-EMBS International Conference on Biomedical and Health Informatics (BHI ...) · doi:10.1109/bhi56158.2022.9926795 · Cited by 6
Electroencephalograms in Diagnosis of Autism
Ahmadlou, M., & Adeli, H. (2013) · Springer eBooks · doi:10.1007/978-1-4614-4788-7_204 · Cited by 6
Liu, H., Meng, Q., Zhang, Q., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-42294-7_14 · Cited by 6
LPVG analysis of the EEG activity in Alzheimer's disease patients
Cai, L., Wang, J., Cao, Y., et al. (2016) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2016.7578491 · Cited by 6
Makaram, N., & Swaminathan, R. (2019) · doi:10.1109/embc.2019.8856680 · Cited by 6
Nonlinear correlations in multifractals: Visibility graphs of magnitude and sign series
Manshour, P. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5132614 · Cited by 6
An Adversarial Examples Identification Method for Time Series in Internet-of-Things System
Jiang, H., Nai, H., Jiang, Y., Du, W. T., Yang, J., & Wu, L. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3005688 · Cited by 6
Subba, N., Ahmed, A., Haldar, P. K., et al. (2020) · International Journal of Modern Physics E · doi:10.1142/s0218301321500026 · Cited by 6
Tejera, E., Rodrigues, A. I., Areias, M. J., et al. (2010) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2010.07.009 · Cited by 6
A Joint Spectral Similarity Measure for Graphs Classification
Bay-Ahmed, H.-A., Boudraa, A., & Daré-Emzivat, D. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.12.014 · Cited by 6
VisExpA: Visibility expansion algorithm in the topology of complex networks
Tsiotas, D., & Charakopoulos, A. (2019) · SoftwareX · doi:10.1016/j.softx.2019.100379 · Cited by 6
Non-perennial stream networks as directed acyclic graphs: The R-package streamDAGPreprint
Aho, K. A., Kriloff, C., Godsey, S. E., et al. (2023) · doi:10.1016/j.envsoft.2023.105775 · Cited by 6
Modak, S., Samanta, K., Halder, S., et al. (2025) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2025.3552448 · Cited by 5
Interpretable transformation and analysis of timelines through learning via surprisability
Mokryn, O., Lazebnik, T., & Shoshan, H. B. (2025) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0269365 · Cited by 5
Explainability in carbon price forecasting systems: A systematic literature review
Altiary, M., & Hussain, F. K. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114612 · Cited by 6
Alkhamali, E. A., Allinjawi, A., Ashari, R. B., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-28686-z · Cited by 5
Liu, S., & Fu, Z. (2023) · Atmospheric Pollution Research · doi:10.1016/j.apr.2023.101883 · Cited by 5
Network representations of attractors for change point detection
Tan, E., Algar, S. D., Corrêa, D., et al. (2023) · Communications Physics · doi:10.1038/s42005-023-01463-y · Cited by 5
Mohammadpoory, Z., Nasrolahzadeh, M., Amiri, S. A., & Haddadnia, J. (2025) · Cognitive Computation · doi:10.1007/s12559-024-10398-7 · Cited by 6
Multilayer horizontal visibility graphs for multivariate time series analysis
Silva, V. F., Silva, M. E., Ribeiro, P., et al. (2025) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-025-01089-4 · Cited by 5
Brain functional connectivity network during deception: a visibility graph approach
Saryazdi, A. R., Bayani, A., Ghassemi, F., & Rajagopal, K. (2025) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-025-01607-x · Cited by 7
Complexity Theory and Dynamic Characteristics of Cognitive Processes
Soloviev, V., Моісеєнко, Н. В., & Тарасова, О. Ю. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-39459-2_11 · Cited by 5
IV-GNN : interval valued data handling using graph neural network
Dawn, S., & Bandyopadhyay, S. (2022) · Applied Intelligence · doi:10.1007/s10489-022-03780-1 · Cited by 5
Visibility Graph Network of Multidimensional Time Series Data for Protein Structure Classification
Zervou, M. A., Doutsi, E., & Tsakalides, P. (2021) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco54536.2021.9616113 · Cited by 5
TS2V: A Transformer-Based Siamese Network for Representation Learning of Univariate Time-Series Data
Ye, C., & Ma, Q. (2022) · International Conference on Computer Supported Cooperative Work in Design (CSCWD) · doi:10.1109/cscwd54268.2022.9776300 · Cited by 6
Heterogeneous Feature Based Time Series Classification With Attention Mechanism
Zhang, H., Wang, P., Liang, S., Zhou, T., & Wang, W. (2022) · IEEE Access · doi:10.1109/access.2022.3188393 · Cited by 5
Charakopoulos, A., & Karakasidis, T. E. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127929 · Cited by 5
Assigning Degrees of Stochasticity to Blazar Light Curves in the Radio Band Using Complex Networks
Acosta, B., Max-Moerbeck, W., Pastén, D., et al. (2022) · Entropy · doi:10.3390/e24081063 · Cited by 5
Analysis of total carbon emissions from transport in the world: A visibility graph network approach
Ji, H., Lan, L., Wang, L., et al. (2022) · Modern Physics Letters B · doi:10.1142/s0217984922501214 · Cited by 5
Alcoholic EEG Data Classification Using Weighted Graph-Based Technique
Supriya, S., Jan, T., Sidnal, N. S., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20627-6_25 · Cited by 5
Complex Network Methods for Plastic Deformation Dynamics in Metals
Kiv, A. E., Bryukhanov, A. A., Soloviev, V., et al. (2023) · Dynamics · doi:10.3390/dynamics3010004 · Cited by 5
A complex networks based approach to nonlinear aeroelasticity
Varun, H. S., Aswathy, M. S., & Sarkar, S. (2023) · Journal of Fluids and Structures · doi:10.1016/j.jfluidstructs.2023.103912 · Cited by 5
Multifractality and scale-free network topology in a noise-perturbed laminar jet
Guan, Y., Zhu, Y., Yang, Z., et al. (2023) · Journal of Fluid Mechanics · doi:10.1017/jfm.2023.693 · Cited by 5
Pal, M., Tiwari, Y., Reddy, T. V., Aditya, P. S. R., & Panigrahi, P. K. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-48876-4_21 · Cited by 5
Direct lingam and visibility graphs for analyzing brain connectivity in BCI
Majdi, H., Azarnoosh, M., Ghoshuni, M., et al. (2024) · Medical & Biological Engineering & Computing · doi:10.1007/s11517-024-03048-5 · Cited by 5
EPMoghaddam, D., Muguli, A., & Aazhang, B. (2023) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/ieeeconf59524.2023.10476818 · Cited by 5
Evaluation of operational resilience in electrical distribution systems
Dwivedi, D., Babu, K. V. S. M., Yemula, P. K., Chakraborty, P., & Pal, M. (2024) · Electric Power Systems Research · doi:10.1016/j.epsr.2024.110537 · Cited by 5
Quasiperiodic graphs at the onset of chaos
Luque, B., Gracia, M. A. C., Gómez, M., et al. (2013) · Physical Review E · doi:10.1103/physreve.88.062918 · Cited by 5
Self-citationEmmert‐Streib, F. (2011) · PLoS ONE · doi:10.1371/journal.pone.0027733 · Cited by 5
Condition diagnosis with complex network-time series analysis
Pan, J., Jiang, H., Gao, J., et al. (2011) · Proceedings, annual Reliability and Maintainability Symposium/Proceedings. Annual Reliability and Maintainability Symposium · doi:10.1109/rams.2011.5754502 · Cited by 5
A universal mechanism for long-range cross-correlations
Diakonos, F. Κ., Karlis, A. K., & Schmelcher, P. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/105/26004 · Cited by 5
Graphic analysis and multifractal on percolation-based return interval series
Pei, A., & Wang, J. (2015) · International Journal of Modern Physics C · doi:10.1142/s0129183115501375 · Cited by 5
Feasibility Study for Visibility Algorithms Implementation in Surface Texture Characterization
Lobera, A. S., González, I., Rodríguez, J., et al. (2015) · Procedia Engineering · doi:10.1016/j.proeng.2015.12.565 · Cited by 5
Self-citationMondal, M., Mondal, A., Mondal, J., et al. (2018) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2018.06.006 · Cited by 5
Xie, W.-J., Han, R.-Q., & Zhou, W.-X. (2019) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/125/18002 · Cited by 5
Graphical Models Over Heterogeneous Domains and for Multilevel Networks
Dimitrova, T., & Kocarev, L. (2018) · IEEE Access · doi:10.1109/access.2018.2880840 · Cited by 5
Characterising obstructive sleep apnea patients through complex networks
Zanin, M., Tuñas, J. M., Bailly, S., Pépin, J., Hainaut, P. L., & Menasalvas, E. (2019) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2018.12.031 · Cited by 5
Recurrence network analysis in a model tripartite quantum system
Laha, P., Lakshmibala, S., & Balakrishnan, V. (2019) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/125/60005 · Cited by 5
Solving the speed and accuracy of box-covering problem in complex networks
Liao, H., Wu, X., Wang, B.-H., et al. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.04.242 · Cited by 5
Jiang, H., Zhang, A., Zhang, Z., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22808-8_52 · Cited by 5
Forecasting Earthquakes by Hybrid Model of Pattern Informatic and PageRank Methods
Rezaei, S., Moghaddasi, H., Darooneh, A. H., et al. (2019) · Bulletin of the Seismological Society of America · doi:10.1785/0120180346 · Cited by 5
A Data-Driven Dynamic Data Fusion Method Based on Visibility Graph and Evidence Theory
Liu, G., & Xiao, F. (2019) · IEEE Access · doi:10.1109/access.2019.2931951 · Cited by 5
Analyzing Reaction Time and Error Sequences in Lexical Decision Experiments
ten Bosch, L., Boves, L., & Mulder, K. (2019) · Interspeech (USB) · doi:10.21437/interspeech.2019-2611 · Cited by 5
A Stock Index Prediction Framework: Integrating Technical and Topological Mesoscale Indicators
Qi, Z., Bu, Z., Xiong, X., et al. (2019) · IEEE International Conference on Information Reuse and Integration for Data Science (IRI) · doi:10.1109/iri.2019.00018 · Cited by 5
Using symbolic networks to analyse dynamical properties of disease outbreaks
Herrera, J. L., Buldú, J. M., Chávez, M., & Martínez, J. H. (2020) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2019.0777 · Cited by 5
False alarms reduction in non-convulsive status epilepticus detection via continuous EEG analysis
Wang, Y., Long, X., van Dijk, J. P., et al. (2020) · Physiological Measurement · doi:10.1088/1361-6579/ab8cb3 · Cited by 5
Jensen–Shannon Divergence Based on Horizontal Visibility Graph for Complex Time Series
Yin, Y., Wang, W., Li, Q., et al. (2020) · Fluctuation and Noise Letters · doi:10.1142/s0219477521500139 · Cited by 5
Time Series Anomaly Detection Based on Graph Convolutional Networks
Hu, Z., Wu, T., Zhang, Y., et al. (2020) · International Conference on Applied Machine Learning (ICAML) · doi:10.1109/icaml51583.2020.00036 · Cited by 5
MagInfoNet: Magnitude Estimation Using Seismic Information Augmentation and Graph Transformer
Chen, Z., Wang, Z., Wu, S., Wang, Y., & Gao, J. (2022) · Earth and Space Science · doi:10.1029/2022ea002580 · Cited by 5
Latent Stochastic Differential Equations for Change Point Detection
Ryzhikov, A., Hushchyn, M., & Деркач, Д. (2023) · IEEE Access · doi:10.1109/access.2023.3318318 · Cited by 5
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
