Daylight Saving Time transitions and Cardiovascular Disease in Andalusia: Time Series Modeling and Analysis Using Visibility Graphs.

The present study aimed to determine whether transitions both to and from daylight saving time (DST) led to an increase in the incidence of hospital admissions for major acute cardiovascular events (MACE). To support the analysis, natural visibility graphs (NVGs) were used with data from Andalusian public hospitals between 2009 and 2019. We calculated the incidence rates of hospital admissions for MACE, and specifically acute myocardial infarction and ischemic stroke during the 2 weeks leading up to, and 2 weeks after, the DST transition. NVG were applied to identify dynamic patterns. The study included 157 221 patients diagnosed with MACE, 71 992 with AMI (42 975 ST-elevation myocardial infarction (STEMI) and 26 752 non-ST-elevation myocardial infarction (NSTEMI)), and 51 420 with ischemic stroke. Observed/expected ratios shown an increased risk of AMI (1.06; 95% CI (1.00-1.11); P = .044), NSTEMI (1.12; 95% CI (1.02-1.22); P = .013), and acute coronary syndrome (1.05; 95% CI (1.00-1.10); P = .04) around the autumn DST. The NVG showed slight variations in the daily pattern of pre-DST and post-DST hospitalization admissions for all pathologies, but indicated that the increase in the incidence of hospital admissions after the DST is not sufficient to change the normal pattern significantly.

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.

Improving graph-based detection of singular events for photochemical smog agents.

Recently, a set of graph-based tools have been introduced for the identification of singular events of O3, NO2 and temperature time series, as well as description of their dynamics. These are based on the use of the Visibility Graphs (VG). In this work, an improvement of the original approach is proposed, being called Upside-Down Visibility Graph (UDVG). It adds the possibility of investigating the singular lowest episodes, instead of the highest. Results confirm the applicability of the new method for describing the multifractal nature of the underlying O3, NO2, and temperature. Asymmetries in the NO2 degree distribution are observed, possibly due to the interaction with different chemicals. Furthermore, a comparison of VG and UDVG has been performed and the outcomes show that they describe opposite subsets of the time series (low and high values) as expected. The combination of the results from the two networks is proposed and evaluated, with the aim of obtaining all the information at once. It turns out to be a more complete tool for singularity detection in photochemical time series, which could be a valuable asset for future research.

A sliding window-based algorithm for faster transformation of time series into complex networks.

A new alternative method to approximate the Visibility Graph (VG) of a time series has been introduced here. It exploits the fact that most of the nodes in the resulting network are not connected to those that are far away from them. This means that the adjacency matrix is almost empty, and its nonzero values are close to the main diagonal. This new method is called Sliding Visibility Graph (SVG). Numerical tests have been performed for several time series, showing a time efficiency that scales linearly with the size of the series [O(N)], in contrast to the original VG that does so quadratically [O(N2)]. This fact is noticeably convenient when dealing with very large time series. The results obtained from the SVG of the studied time series have been compared to the exact values of the original VG. As expected, the SVG outcomes converge very rapidly to the desired ones, especially for random and stochastic series. Also, this method can be extended to the analysis of time series that evolve in real time, since it does not require the entire dataset to perform the analysis but a shorter segment of it. The length segment can remain constant, making possible a simple analysis as the series evolves in time.