Network-based features for retinal fundus vessel structure analysis

Retinal fundus imaging is a non-invasive method that allows visualizing the structure of the blood vessels in the retina whose features may indicate the presence of diseases such as diabetic retinopathy (DR) and glaucoma. Here we present a novel method to analyze and quantify changes in the retinal blood vessel structure in patients diagnosed with glaucoma or with DR. First, we use an automatic unsupervised segmentation algorithm to extract a tree-like graph from the retina blood vessel structure. The nodes of the graph represent branching (bifurcation) points and endpoints, while the links represent vessel segments that connect the nodes. Then, we quantify structural differences between the graphs extracted from the groups of healthy and non-healthy patients. We also use fractal analysis to characterize the extracted graphs. Applying these techniques to three retina fundus image databases we find significant differences between the healthy and non-healthy groups (p-values lower than 0.005 or 0.001 depending on the method and on the database). The results are sensitive to the segmentation method (manual or automatic) and to the resolution of the images.Peer ReviewedPostprint (published version

Conflict Dynamics in Scale-Free Networks with Degree Correlations and Hierarchical Structure

We present a study of the dynamic interactions between actors located on complex networks with scale-free and hierarchical scale-free topologies with assortative mixing, that is, correlations between the degree distributions of the actors. The actor’s state evolves according to a model that considers its previous state, the inertia to change, and the influence of its neighborhood. We show that the time evolution of the system depends on the percentage of cooperative or competitiveinteractions. For scale-free networks, we find that the dispersion between actors is higher when all interactions are either cooperative or competitive, while a balanced presence of interactions leads to a lower separation. Moreover, positive assortative mixing leads to greater divergence between the states, while negative assortative mixing reduces this dispersion. We also find that hierarchical scale-free networks have both similarities and differences when compared with scale-free networks. Hierarchical scale-free networks, like scale-free networks, show the least divergence for an equal mix of cooperative and competitive interactions between actors. On the other hand, hierarchical scale-free networks, unlike scale-free networks, show much greater divergence when dominated by cooperative rather than competitive actors, and while the formation of a rich club (adding links between hubs) with cooperative interactions leads to greater divergence, the divergence is much less when they are fully competitive. Our findings highlight the importance of the topology where the interaction dynamics take place, and the fact that a balanced presence of cooperators and competitors makes the system more cohesive, compared to the case where one strategy dominates

Word-Length Correlations and Memory in Large Texts: A Visibility Network Analysis

We study the correlation properties of word lengths in large texts from 30 ebooks in the English language from the Gutenberg Project (www.gutenberg.org) using the natural visibility graph method (NVG). NVG converts a time series into a graph and then analyzes its graph properties. First, the original sequence of words is transformed into a sequence of values containing the length of each word, and then, it is integrated. Next, we apply the NVG to the integrated word-length series and construct the network. We show that the degree distribution of that network follows a power law, P(k)∼k−γP(k)∼k-γ, with two regimes, which are characterized by the exponents γs≈1.7γs≈1.7 (at short degree scales) and γl≈1.3γl≈1.3 (at large degree scales). This suggests that word lengths are much more strongly correlated at large distances between words than at short distances between words. That finding is also supported by the detrended fluctuation analysis (DFA) and recurrence time distribution. These results provide new information about the universal characteristics of the structure of written texts beyond that given by word frequencies

Word-Length Correlations and Memory in Large Texts: A Visibility Network Analysis

We study the correlation properties of word lengths in large texts from 30 ebooks in the English language from the Gutenberg Project (www.gutenberg.org) using the natural visibility graph method (NVG). NVG converts a time series into a graph and then analyzes its graph properties. First, the original sequence of words is transformed into a sequence of values containing the length of each word, and then, it is integrated. Next, we apply the NVG to the integrated word-length series and construct the network. We show that the degree distribution of that network follows a power law, P ( k ) ∼ k - γ , with two regimes, which are characterized by the exponents γ s ≈ 1 . 7 (at short degree scales) and γ l ≈ 1 . 3 (at large degree scales). This suggests that word lengths are much more strongly correlated at large distances between words than at short distances between words. That finding is also supported by the detrended fluctuation analysis (DFA) and recurrence time distribution. These results provide new information about the universal characteristics of the structure of written texts beyond that given by word frequencies

Series de actividad sísmica: escalamiento en redes de visibilidad

Instituto Politécnico Naciona

Sincronización de señales 1/f

Instituto Politécnico Naciona

Sincronización en señales 1/f

Laboratorios de Sistemas Complejo

Simplicial complex entropy for time series analysis

Abstract The complex behavior of many systems in nature requires the application of robust methodologies capable of identifying changes in their dynamics. In the case of time series (which are sensed values of a system during a time interval), several methods have been proposed to evaluate their irregularity. However, for some types of dynamics such as stochastic and chaotic, new approaches are required that can provide a better characterization of them. In this paper we present the simplicial complex approximate entropy, which is based on the conditional probability of the occurrence of elements of a simplicial complex. Our results show that this entropy measure provides a wide range of values with details not easily identifiable with standard methods. In particular, we show that our method is able to quantify the irregularity in simulated random sequences and those from low-dimensional chaotic dynamics. Furthermore, it is possible to consistently differentiate cardiac interbeat sequences from healthy subjects and from patients with heart failure, as well as to identify changes between dynamical states of coupled chaotic maps. Our results highlight the importance of the structures revealed by the simplicial complexes, which holds promise for applications of this approach in various contexts