Distinction of Chaos from Randomness Is Not Possible from the Degree Distribution of the Visibility and Phase Space Reconstruction Graphs.

We investigate whether it is possible to distinguish chaotic time series from random time series using network theory. In this perspective, we selected four methods to generate graphs from time series: the natural, the horizontal, the limited penetrable horizontal visibility graph, and the phase space reconstruction method. These methods claim that the distinction of chaos from randomness is possible by studying the degree distribution of the generated graphs. We evaluated these methods by computing the results for chaotic time series from the 2D Torus Automorphisms, the chaotic Lorenz system, and a random sequence derived from the normal distribution. Although the results confirm previous studies, we found that the distinction of chaos from randomness is not generally possible in the context of the above methodologies.

Estimating pandemic effects in urban mass transportation systems: An approach based on visibility graphs and network similarity.

The COVID-19 pandemic has caused unprecedented disruptions to urban systems worldwide, but the extent and nature of these disruptions are not yet fully understood when it comes to transportation. In this work, we aim to explore how social distancing policies have affected passenger demand in urban mass transportation systems with the goal of supporting informed decisions in policy planning. We propose an approach based on complex networks and clustering time series with similar behavior, investigating possible changes in similarity patterns during pandemics and how they reflect into a regional scale. The methods shown here proved useful in detecting that lines in central or peripheral regions present different dynamics, that bus lines have changed their behavior during pandemic so that similarity relations have changed significantly, and that when social distancing started, there was an abrupt shock in the properties of daily passenger time series, and the system did not return to its original behavior until the end of the evaluated period. The approach allows to track evolution of the community structure in different scenarios providing managers with tools to reinforce or destabilize similarities if needed.

Visibility Graph Analysis of the Seismic Activity of Three Areas of the Cocos Plate Mexican Subduction Where the Last Three Large Earthquakes (M > 7) Occurred in 2017 and 2022.

The understanding of the dynamical behavior of seismic phenomena is currently an open problem, mainly because seismic series can be considered to be produced by phenomena exhibiting dynamic phase transitions; that is, with some complexity. For this purpose, the Middle America Trench in central Mexico is considered a natural laboratory for examining subduction because of its heterogenous natural structure. In this study, the Visibility Graph method was applied to study the seismic activity of three regions within the Cocos plate: the Tehuantepec Isthmus, the Flat slab and Michoacan, each one with a different level of seismicity. The method maps time series into graphs, and it is possible to connect the topological properties of the graph with the dynamical features underlying the time series. The seismicity analyzed was monitored in the three areas studied between 2010 and 2022. At the Flat Slab and Tehuantepec Isthmus, two intense earthquakes occurred on 7 and 19 September 2017, respectively, and, on 19 September 2022, another one occurred at Michoacan. The aim of this study was to determine the dynamical features and the possible differences between the three areas by applying the following method. First, the time evolution of the a- and b-values in the Gutenberg-Richter law was analyzed, followed by the relationship between the seismic properties and topological features using the VG method, the k-M slope and the characterization of the temporal correlations from the γ-exponent of the power law distribution, P(k) ∼ k-γ, and its relationship with the Hurst parameter, which allowed us to identify the correlation and persistence of each zone.

Characterizing the Solar Activity Using the Visibility Graph Method.

In this paper, the Sun and its behavior are studied by means of complex networks. The complex network was built using the Visibility Graph algorithm. This method maps time series into graphs in which every element of the time series is considered as a node and a visibility criterion is defined in order to connect them. Using this method, we construct complex networks for magnetic field and sunspots time series encompassing four solar cycles, and various measures such as degree, clustering coefficient, mean path length, betweenness centrality, eigenvector centrality and decay exponents were calculated. In order to study the system in several time scales, we perform both a global, where the network contains information on the four solar cycles, and a local analysis, involving moving windows. Some metrics correlate with solar activity, while others do not. Interestingly, those metric which seem to respond to varying levels of solar activity in the global analysis, also do in the moving windows analysis. Our results suggest that complex networks can provide a useful way to follow solar activity, and reveal new features on solar cycles.

[A method of mental disorder recognition based on visibility graph].

The causes of mental disorders are complex, and early recognition and early intervention are recognized as effective way to avoid irreversible brain damage over time. The existing computer-aided recognition methods mostly focus on multimodal data fusion, ignoring the asynchronous acquisition problem of multimodal data. For this reason, this paper proposes a framework of mental disorder recognition based on visibility graph (VG) to solve the problem of asynchronous data acquisition. First, time series electroencephalograms (EEG) data are mapped to spatial visibility graph. Then, an improved auto regressive model is used to accurately calculate the temporal EEG data features, and reasonably select the spatial metric features by analyzing the spatiotemporal mapping relationship. Finally, on the basis of spatiotemporal information complementarity, different contribution coefficients are assigned to each spatiotemporal feature and to explore the maximum potential of feature so as to make decisions. The results of controlled experiments show that the method in this paper can effectively improve the recognition accuracy of mental disorders. Taking Alzheimer's disease and depression as examples, the highest recognition rates are 93.73% and 90.35%, respectively. In summary, the results of this paper provide an effective computer-aided tool for rapid clinical diagnosis of mental disorders.

Visibility graph for time series prediction and image classification: a review.

The analysis of time series and images is significant across different fields due to their widespread applications. In the past few decades, many approaches have been developed, including data-driven artificial intelligence methods, mechanism-driven physical methods, and hybrid mechanism and data-driven models. Complex networks have been used to model numerous complex systems due to its characteristics, including time series prediction and image classification. In order to map time series and images into complex networks, many visibility graph algorithms have been developed, such as horizontal visibility graph, limited penetrable visibility graph, multiplex visibility graph, and image visibility graph. The family of visibility graph algorithms will construct different types of complex networks, including (un-) weighted, (un-) directed, and (single-) multi-layered networks, thereby focusing on different kinds of properties. Different types of visibility graph algorithms will be reviewed in this paper. Through exploring the topological structure and information in the network based on statistical physics, the property of time series and images can be discovered. In order to forecast (multivariate) time series, several variations of local random walk algorithms and different information fusion approaches are applied to measure the similarity between nodes in the network. Different forecasting frameworks are also proposed to consider the information in the time series based on the similarity. In order to classify the image, several machine learning models (such as support vector machine and linear discriminant) are used to classify images based on global features, local features, and multiplex features. Through various simulations on a variety of datasets, researchers have found that the visibility graph algorithm outperformed existing algorithms, both in time series prediction and image classification. Clearly, complex networks are closely connected with time series and images by visibility graph algorithms, rendering complex networks to be an important tool for understanding the characteristics of time series and images. Finally, we conclude in the last section with future outlooks for the visibility graph.

Assigning Degrees of Stochasticity to Blazar Light Curves in the Radio Band Using Complex Networks.

We focus on characterizing the high-energy emission mechanisms of blazars by analyzing the variability in the radio band of the light curves of more than a thousand sources. We are interested in assigning complexity parameters to these sources, modeling the time series of the light curves with the method of the Horizontal Visibility Graph (HVG), which allows us to obtain properties from degree distributions, such as a characteristic exponent to describe its stochasticity and the Kullback-Leibler Divergence (KLD), presenting a new perspective to the methods commonly used to study Active Galactic Nuclei (AGN). We contrast these parameters with the excess variance, which is an astronomical measurement of variability in light curves; at the same time, we use the spectral classification of the sources. While it is not possible to find significant correlations with the excess variance, the degree distributions extracted from the network are detecting differences related to the spectral classification of blazars. These differences suggest a chaotic behavior in the time series for the BL Lac sources and a correlated stochastic behavior in the time series for the FSRQ sources. Our results show that complex networks may be a valuable alternative tool to study AGNs according to the variability of their energy output.

Visibility Graph Analysis of Reservoir-Triggered Seismicity: The Case of Song Tranh 2 Hydropower, Vietnam.

In this study, the visibility graph analysis of seismicity triggered by Song Tranh 2 hydropower (Vietnam) is performed. The relationship between the seismic (the Gutenberg-Richter b-value) and topological (the k-M slope) parameters of seismicity is analysed. Our findings indicate that the relationship between the Gutenberg-Richter b-value and the k-M slope of the investigated seismicity is in agreement with that characterising the tectonic seismicity. The results obtained from analysing the reservoir-triggered seismicity of Song Tranh 2 area could contribute to better characterisation of the relationship between the seismological and topological parameters of seismicity, strengthening the universal character of the relationship between the b-value and the k-M slope.

Nonlinear Statistical Features of the Seismicity in the Subduction Zone of Tehuantepec Isthmus, Southern México.

After the M8.2 main-shock occurred on 7 September 2017 at the Isthmus of Tehuantepec, Mexico, the spatial distribution of seismicity has showed a clear clusterization of earthquakes along the collision region of the Tehuantepec Transform/Ridge with the Middle America Trench off Chiapas. Furthermore, nowadays, the temporal rate of occurrence in the number of earthquakes has also showed a pronounced increase. On the basis of this behavior, we studied the sequence of magnitudes of the earthquakes which occurred within the Isthmus of Tehuantepec in southern Mexico from 2010 to 2020. Since big earthquakes are considered as a phase transition, after the M8.2 main-shock, one must expect changes in the Tehuantepec ridge dynamics, which can be observed considering that the b-value in the Gutenberg-Richter law, has also showed changes in time. The goal of this paper is to characterize the behavior of the seismic activity by using the Gutenberg-Richter law, multifractal detrended fluctuation analysis, visibility graph and nowcasting method. Those methods have showed important parameters in order to assess risk, the multifractality and connectivity. Our findings indicate, first that b-value shows a dependency on time, which is clearly described by our analyses based on nowcasting method, multifractality and visibility graph.

EEG-Based Emotion Recognition Using an Improved Weighted Horizontal Visibility Graph.

Emotion recognition, as a challenging and active research area, has received considerable awareness in recent years. In this study, an attempt was made to extract complex network features from electroencephalogram (EEG) signals for emotion recognition. We proposed a novel method of constructing forward weighted horizontal visibility graphs (FWHVG) and backward weighted horizontal visibility graphs (BWHVG) based on angle measurement. The two types of complex networks were used to extract network features. Then, the two feature matrices were fused into a single feature matrix to classify EEG signals. The average emotion recognition accuracies based on complex network features of proposed method in the valence and arousal dimension were 97.53% and 97.75%. The proposed method achieved classification accuracies of 98.12% and 98.06% for valence and arousal when combined with time-domain features.

Applying the Horizontal Visibility Graph Method to Study Irreversibility of Electromagnetic Turbulence in Non-Thermal Plasmas.

One of the fundamental open questions in plasma physics is the role of non-thermal particles distributions in poorly collisional plasma environments, a system that is commonly found throughout the Universe, e.g., the solar wind and the Earth's magnetosphere correspond to natural plasma physics laboratories in which turbulent phenomena can be studied. Our study perspective is born from the method of Horizontal Visibility Graph (HVG) that has been developed in the last years to analyze time series avoiding the tedium and the high computational cost that other methods offer. Here, we build a complex network based on directed HVG technique applied to magnetic field fluctuations time series obtained from Particle In Cell (PIC) simulations of a magnetized collisionless plasma to distinguish the degree distributions and calculate the Kullback-Leibler Divergence (KLD) as a measure of relative entropy of data sets produced by processes that are not in equilibrium. First, we analyze the connectivity probability distribution for the undirected version of HVG finding how the Kappa distribution for low values of κ tends to be an uncorrelated time series, while the Maxwell-Boltzmann distribution shows a correlated stochastic processes behavior. Subsequently, we investigate the degree of temporary irreversibility of magnetic fluctuations that are self-generated by the plasma, comparing the case of a thermal plasma (described by a Maxwell-Botzmann velocity distribution function) with non-thermal Kappa distributions. We have shown that the KLD associated to the HVG is able to distinguish the level of reversibility that is associated to the thermal equilibrium in the plasma, because the dissipative degree of the system increases as the value of κ parameter decreases and the distribution function departs from the Maxwell-Boltzmann equilibrium.

Analysis of Air Mean Temperature Anomalies by Using Horizontal Visibility Graphs.

The last decades have been successively warmer at the Earth's surface. An increasing interest in climate variability is appearing, and many research works have investigated the main effects on different climate variables. Some of them apply complex networks approaches to explore the spatial relation between distinct grid points or stations. In this work, the authors investigate whether topological properties change over several years. To this aim, we explore the application of the horizontal visibility graph (HVG) approach which maps a time series into a complex network. Data used in this study include a 60-year period of daily mean temperature anomalies in several stations over the Iberian Peninsula (Spain). Average degree, degree distribution exponent, and global clustering coefficient were analyzed. Interestingly, results show that they agree on a lack of significant trends, unlike annual mean values of anomalies, which present a characteristic upward trend. The main conclusions obtained are that complex networks structures and nonlinear features, such as weak correlations, appear not to be affected by rising temperatures derived from global climate conditions. Furthermore, different locations present a similar behavior and the intrinsic nature of these signals seems to be well described by network parameters.

Crash Diagnosis and Price Rebound Prediction in NYSE Composite Index Based on Visibility Graph and Time-Evolving Stock Correlation Network.

This study proposes a framework to diagnose stock market crashes and predict the subsequent price rebounds. Based on the observation of anomalous changes in stock correlation networks during market crashes, we extend the log-periodic power-law model with a metric that is proposed to measure network anomalies. To calculate this metric, we design a prediction-guided anomaly detection algorithm based on the extreme value theory. Finally, we proposed a hybrid indicator to predict price rebounds of the stock index by combining the network anomaly metric and the visibility graph-based log-periodic power-law model. Experiments are conducted based on the New York Stock Exchange Composite Index from 4 January 1991 to 7 May 2021. It is shown that our proposed method outperforms the benchmark log-periodic power-law model on detecting the 12 major crashes and predicting the subsequent price rebounds by reducing the false alarm rate. This study sheds light on combining stock network analysis and financial time series modeling and highlights that anomalous changes of a stock network can be important criteria for detecting crashes and predicting recoveries of the stock market.

Visibility graph analysis of temporal irreversibility in sleep electroencephalograms.

The study of sleep has continued to garner increased attention. However, most studies assume stationarity of sleep electroencephalogram (EEG) signals, whereas they are typically nonlinear and nonstationary. Little work has focused on the time irreversibility of sleep EEG signals. Hence, the aim of this work is to reveal the temporally irreversible structures of rapid-eye-movement (REM) and non-REM sleep using a visibility algorithm, which is robust to nonstationarity and finite-size effect. Results show that the temporal structure of non-REM sleep is more irreversible than that of REM sleep. The degree of irreversibility is highest in slow-wave sleep. Moreover, statistical analysis suggests that aging is the major factor that affects the irreversibility of sleep signals, while gender and body mass index contribute insignificantly. The dominant role of slow oscillations on the irreversible structures of the sleep signals is also indicated.

Accurate Indoor Localization Based on CSI and Visibility Graph.

Passive indoor localization techniques can have many important applications. They are nonintrusive and do not require users carrying measuring devices. Therefore, indoor localization techniques are widely used in many critical areas, such as security, logistics, healthcare, etc. However, because of the unpredictable indoor environment dynamics, the existing nonintrusive indoor localization techniques can be quite inaccurate, which greatly limits their real-world applications. To address those problems, in this work, we develop a channel state information (CSI) based indoor localization technique. Unlike the existing methods, we employ both the intra-subcarrier statistics features and the inter-subcarrier network features. Specifically, we make the following contributions: (1) we design a novel passive indoor localization algorithm which combines the statistics and network features; (2) we modify the visibility graph (VG) technique to build complex networks for the indoor localization applications; and (3) we demonstrate the effectiveness of our technique using real-world deployments. The experimental results show that our technique can achieve about 96% accuracy on average and is more than 9% better than the state-of-the-art techniques.

A Semi-Supervised Approach to Bearing Fault Diagnosis under Variable Conditions towards Imbalanced Unlabeled Data.

Fault diagnosis of rolling element bearings is an effective technology to ensure the steadiness of rotating machineries. Most of the existing fault diagnosis algorithms are supervised methods and generally require sufficient labeled data for training. However, the acquisition of labeled samples is often laborious and costly in practice, whereas there are abundant unlabeled samples which also imply health information of bearings. Thus, it is worthwhile to develop semi-supervised methods of fault diagnosis to make effective use of the plentiful unlabeled samples. Nevertheless, considering the normal data are much more than the faulty ones, the problem of imbalanced data exists among unlabeled samples for fault diagnosis. Besides, in practice, bearings often work under uncertain and variable operation conditions, which would also have negative influence on fault diagnosis. To solve these issues, a novel hybrid method for bearing fault diagnosis is proposed in this paper: (1) Inspired by visibility graph, a novel fault feature extraction method named visibility graph feature (VGF) is proposed. The obtained features by VGF are natively insensitive to variable conditions, which has been validated by a simulation experiment in this paper; (2) On basis of VGF, to deal with imbalanced unlabeled data, graph-based rebalance semi-supervised learning (GRSSL) for fault diagnosis is proposed. In GRSSL, a graph based on a weighted sparse adjacency matrix is constructed by the k-nearest neighbors and Gaussian Kernel weighting algorithm by means of the samples. Then, a bivariate cost function over classification and normalized label variable is built up to rebalance the importance of labels. Finally, the proposed VGF-GRSSL method was verified by data collected from Case Western Reserve University Bearing Data Center. The experiment results show that the proposed method of bearing fault diagnosis performs effectively to deal with the imbalanced unlabeled data under variable conditions.

Horizontal visibility graph transfer entropy (HVG-TE): A novel metric to characterize directed connectivity in large-scale brain networks.

We propose a new measure, horizontal visibility graph transfer entropy (HVG-TE), to estimate the direction of information flow between pairs of time series. HVG-TE quantifies the transfer entropy between the degree sequences of horizontal visibility graphs derived from original time series. Twenty-one Rössler attractors unidirectionally coupled in the posterior-to-anterior direction were used to simulate 21-channel Electroencephalography (EEG) brain networks and validate the performance of the HVG-TE. We showed that the HVG-TE is robust to different levels of coupling strengths between the coupled Rössler attractors, a wide range of time delays, different sample sizes, the effects of noise and linear mixing, and the choice of reference for EEG data. We also applied HVG-TE to EEG data in 20 healthy controls and compared its performance to a recently introduces phase-based TE measure (PTE). We found that compared with PTE, HVG-TE consistently detected stronger posterior-to-anterior information flow patterns in the alpha-band (8-13Hz) EEG brain networks for three different references. Moreover, in contrast to PTE, HVG-TE does not require an assumption on the periodicity of input signals, therefore it can be more widely applicable, even for non-periodic signals. This study shows that the HVG-TE is a directed connectivity measure to characterise the direction of information flow in large-scale brain networks.

Network Representation of fMRI Data Using Visibility Graphs: The Impact of Motion and Test-Retest Reliability.

Visibility graphs provide a novel approach for analysing time-series data. Graph theoretical analysis of visibility graphs can provide new features for data mining applications in fMRI. However, visibility graphs features have not been used widely in the field of neuroscience. This is likely due to a lack of understanding of their robustness in the presence of noise (e.g., motion) and their test-retest reliability. In this study, we investigated visibility graph properties of fMRI data in the human connectome project (N = 1010) and tested their sensitivity to motion and test-retest reliability. We also characterised the strength of connectivity obtained using degree synchrony of visibility graphs. We found that strong correlation (r > 0.5) between visibility graph properties, such as the number of communities and average degrees, and motion in the fMRI data. The test-retest reliability (Intraclass correlation coefficient (ICC)) of graph theoretical features was high for the average degrees (0.74, 95% CI = [0.73, 0.75]), and moderate for clustering coefficient (0.43, 95% CI = [0.41, 0.44]) and average path length (0.41, 95% CI = [0.38, 0.44]). Functional connectivity between brain regions was measured by correlating the visibility graph degrees. However, the strength of correlation was found to be moderate to low (r < 0.35). These findings suggest that even small movement in fMRI data can strongly influence robustness and reliability of visibility graph features, thus, requiring robust motion correction strategies prior to data analysis. Further studies are necessary for better understanding of the potential application of visibility graph features in fMRI.

Direct lingam and visibility graphs for analyzing brain connectivity in BCI.

The brain-computer interface (BCI) is a direct pathway of communication between the electrical activity of the brain and an external device. The present paper was aimed to investigate directed connectivity between different areas of the brain during motor imagery (MI)-based BCI. For this purpose, two methods were implemented including, Limited Penetrable Horizontal Visibility Graph (LPHVG) and Direct Lingam. The visibility graph (VG) is a robust algorithm for analyzing complex systems such as the brain. Direct Lingam uses a non-Gaussian model to extract causal links which is appropriate for analyzing large-scale connectivity. First, LPHVG map MI-EEG (electroencephalogram) signals into networks. After extracting the topological features of the networks, a support vector machine classifier was applied to categorize multi-classes MI. The network of all classes was found to be different from one another, and the kappa value of classification was 0.68. The degree sequence of LPHVG was calculated for each channel in order to obtain the direction of brain information flow. Transfer entropy (TE) is used to compute the relations of the channel degree sequence. Therefore, the directed graph between channels was formed. This method is called LPHVG_TE directed graph. The Bayesian network, also known as the Direct LiNGAM model, was implemented for the second method. Finally, images of the LPHVG and Direct Lingam were classified by convolutional neural network (CNN). In this study, Data sets 2a of BCI competition IV was used. The outcomes reveal that the brain network developed by LPHVG (92.7%) might be more effective to distinguish 4 classes of MI than the Direct Lingam (90.6%) and it was shown that graph theory has the potential to get better efficiency of BCI.

Gershgorin circle theorem-based feature extraction for biomedical signal analysis.

Recently, graph theory has become a promising tool for biomedical signal analysis, wherein the signals are transformed into a graph network and represented as either adjacency or Laplacian matrices. However, as the size of the time series increases, the dimensions of transformed matrices also expand, leading to a significant rise in computational demand for analysis. Therefore, there is a critical need for efficient feature extraction methods demanding low computational time. This paper introduces a new feature extraction technique based on the Gershgorin Circle theorem applied to biomedical signals, termed Gershgorin Circle Feature Extraction (GCFE). The study makes use of two publicly available datasets: one including synthetic neural recordings, and the other consisting of EEG seizure data. In addition, the efficacy of GCFE is compared with two distinct visibility graphs and tested against seven other feature extraction methods. In the GCFE method, the features are extracted from a special modified weighted Laplacian matrix from the visibility graphs. This method was applied to classify three different types of neural spikes from one dataset, and to distinguish between seizure and non-seizure events in another. The application of GCFE resulted in superior performance when compared to seven other algorithms, achieving a positive average accuracy difference of 2.67% across all experimental datasets. This indicates that GCFE consistently outperformed the other methods in terms of accuracy. Furthermore, the GCFE method was more computationally-efficient than the other feature extraction techniques. The GCFE method can also be employed in real-time biomedical signal classification where the visibility graphs are utilized such as EKG signal classification.