Explore the vast range of titles available.

Controllability in temporal networks is considered one of the most important challenges in this type of network. Network controllability methods try to fully control the network with the minimum number of control nodes. This type of network is always exposed to internal and external attacks and failures. Therefore, controllability processes need recovery mechanisms to be resistant to various types of failures. The high volume of temporal networks causes the recovery controllability processes to be disrupted. In the paper, a novel method of recovery controllability in temporal networks is proposed to improving controllability network robustness. To restore controllability of the network, the RCTE framework is proposed, in which a temporal network is converted into snapshots at discrete times and then its dimensions are reduced by using network embedding. Finally, using link prediction based on local and global similarity, links that are subject to failure are identified. The effectiveness of the proposed method against various network attacks has been evaluated and compared with other conventional methods. The results show that the RCTE framework performed better than other conventional methods. Also, the proposed method has more controllability and tolerance against malicious attacks compared to other recovery methods.

Many tasks in graph machine learning, such as link prediction and node classification, are typically solved using representation learning. Each node or edge in the network is encoded via an embedding. Though there exists a lot of network embeddings for static graphs, the task becomes much more complicated when the dynamic ( i.e., temporal) network is analyzed. In this paper, we propose a novel approach for dynamic network representation learning based on Temporal Graph Network by using a highly custom message generating function by extracting Causal Anonymous Walks. We provide a benchmark pipeline for the evaluation of temporal network embeddings. This work provides the first comprehensive comparison framework for temporal network representation learning for graph machine learning problems involving node classification and link prediction in every available setting. The proposed model outperforms state-of-the-art baseline models. The work also justifies their difference based on evaluation in various transductive/inductive edge/node classification tasks. In addition, we show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks, involving credit scoring based on transaction data.

Network neuroscience has become an established paradigm to tackle questions related to the functional and structural connectome of the brain. Recently, interest has been growing in examining the temporal dynamics of the brain’s network activity. Although different approaches to capturing fluctuations in brain connectivity have been proposed, there have been few attempts to quantify these fluctuations using temporal network theory. This theory is an extension of network theory that has been successfully applied to the modeling of dynamic processes in economics, social sciences, and engineering article but it has not been adopted to a great extent within network neuroscience. The objective of this article is twofold: (i) to present a detailed description of the central tenets of temporal network theory and describe its measures, and; (ii) to apply these measures to a resting-state fMRI dataset to illustrate their utility. Furthermore, we discuss the interpretation of temporal network theory in the context of the dynamic functional brain connectome. All the temporal network measures and plotting functions described in this article are freely available as the Python package Teneto. Temporal network theory is a subfield of network theory that has had limited application to date within network neuroscience. The aims of this work are to introduce temporal network theory, define the metrics relevant to the context of network neuroscience, and illustrate their potential by analyzing a resting-state fMRI dataset. We found both between-subjects and between-task differences that illustrate the potential for these tools to be applied in a wider context. Our tools for analyzing temporal networks have been released in a Python package called Teneto.

Complex networks have encouraged scholars to develop an effective method for abstracting and optimizing aviation networks. However, researchers often overlook the aviation network’s temporal attribute and treat it as a static network. Aviation networks have strong temporal characteristics and the dynamic connection cannot be realistically described by a static network. It is necessary to more accurately and realistically represent these connections during the operation of an aviation network. This study explored temporal structures of the Chinese aviation temporal network (CATN) based on flight schedules and actual operational time data. Temporal networks based on time windows were represented to analyze the temporal topology features and robustness of the CATN. The results demonstrated the following: (1) based on the spatial-temporal aviation network, there is a morning departure peak (7:00–8:00) and an evening arrival peak at the airline hub (20:00–21:00); (2) examining the centrality of each airport in the CATN at various time intervals exposed fluctuations in their rankings, which could not be identified by a static network, and (3) the robustness of the CATN was found to be unaffected by time windows, but it displayed poor resilience against deliberate attacks, particularly when subjected to betweenness and closeness attacks, which target the network’s shortest paths. For obtaining a greater understanding of the operating situation of civil aviation, displaying the topological features and robustness of the temporal network is of great importance.

The task of human action recognition (HAR) can be found in many computer vision practical applications. Various data modalities have been considered for solving this task, including joint-based skeletal representations which are suitable for real-time applications on platforms with limited computational resources. We propose a spatio-temporal neural network that uses handcrafted geometric features to classify human actions from video data. The proposed deep neural network architecture combines graph convolutional and temporal convolutional layers. The experiments performed on public HAR datasets show that our model obtains results similar to other state-of-the-art methods but has a lower inference time while offering the possibility to obtain an explanation for the classified action.

Temporal networks have become instrumental in modeling dynamic systems across various disciplines, presenting unique challenges and opportunities in understanding and influencing their behavior. Controllability, a fundamental aspect of network dynamics, plays a pivotal role in manipulating these systems towards desired states. In this paper, we embark on a comprehensive exploration of controllability within the realm of temporal networks. A new method for controlling temporal networks is proposed, in which the intervention of all the dynamics of temporal networks can provide the possibility to speed up the network controllability processes. In the proposed method, the network dynamics are stored in the tree data structure to reduce the computational complexity of the algorithm for finding control nodes while maintaining essential information in controllable processes. Results show that the proposed algorithm with linear complexity of O(N2logNΔt4). Evaluation against conventional methods on experimental datasets reveals notable improvements: a 41.8% reduction in the minimum number of control nodes, a 36.37% decrease in time of receiving fully control network, and a 38.5% reduction in control algorithm execution time compared to layered model-based control methods.Article HighlightsProviding a new method to control temporal networks.Presenting a proposed model based on tree structure to store essential network control information.Providing a new algorithm to find control nodes with polynomial time complexity.

Studies have demonstrated that changes in the climate affect wind power forecasting under different weather conditions. Theoretically, accurate prediction of both wind power output and weather changes using statistics-based prediction models is difficult. In practice, traditional machine learning models can perform long-term wind power forecasting with a mean absolute percentage error (MAPE) of 10% to 17%, which does not meet the engineering requirements for our renewable energy project. Deep learning networks (DLNs) have been employed to obtain the correlations between meteorological features and power generation using a multilayer neural convolutional architecture with gradient descent algorithms to minimize estimation errors. This has wide applicability to the field of wind power forecasting. Therefore, this study aimed at the long-term (24–72-h ahead) prediction of wind power with an MAPE of less than 10% by using the Temporal Convolutional Network (TCN) algorithm of DLNs. In our experiment, we performed TCN model pretraining using historical weather data and the power generation outputs of a wind turbine from a Scada wind power plant in Turkey. The experimental results indicated an MAPE of 5.13% for 72-h wind power prediction, which is adequate within the constraints of our project. Finally, we compared the performance of four DLN-based prediction models for power forecasting, namely, the TCN, long short-term memory (LSTM), recurrent neural network (RNN), and gated recurrence unit (GRU) models. We validated that the TCN outperforms the other three models for wind power prediction in terms of data input volume, stability of error reduction, and forecast accuracy.

Community detection is one of the most popular researches in a variety of complex systems, ranging from biology to sociology. In recent years, there’s an increasing focus on the rapid development of more complicated networks, namely multilayer networks. Communities in a single-layer network are groups of nodes that are more strongly connected among themselves than the others, while in multilayer networks, a group of well-connected nodes are shared in multiple layers. Most traditional algorithms can rarely perform well on a multilayer network without modifications. Thus, in this paper, we offer overall comparisons of existing works and analyze several representative algorithms, providing a comprehensive understanding of community detection methods in multilayer networks. The comparison results indicate that the promoting of algorithm efficiency and the extending for general multilayer networks are also expected in the forthcoming studies.

In the realm of power systems, short-term electric load forecasting is pivotal for ensuring supply–demand balance, optimizing generation planning, reducing operational costs, and maintaining grid stability. Short-term load curves are characteristically coarse, revealing high-frequency data upon decomposition that exhibit pronounced non-linearity and significant noise, complicating efforts to enhance forecasting precision. To address these challenges, this study introduces an innovative model. This model employs complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN) to bifurcate the original load data into low- and high-frequency components. For the smoother low-frequency data, a temporal convolutional network (TCN) is utilized, whereas the high-frequency components, which encapsulate detailed load history information yet suffer from a lower fitting accuracy, are processed using an enhanced soft thresholding TCN (SF-TCN) optimized with the slime mould algorithm (SMA). Experimental tests of this methodology on load forecasts for the forthcoming 24 h across all seasons have demonstrated its superior forecasting accuracy compared to that of non-decomposed models, such as support vector regression (SVR), recurrent neural network (RNN), gated recurrent unit (GRU), long short-term memory (LSTM), convolutional neural network-LSTM (CNN-LSTM), TCN, Informer, and decomposed models, including CEEMDAN-TCN and CEEMDAN-TCN-SMA.

Network ecology is an emerging field that allows researchers to conceptualize and analyse ecological networks and their dynamics. Here, we focus on the dynamics of ecological networks in response to environmental changes. Specifically, we formalize how network topologies constrain the dynamics of ecological systems into a unifying framework in network ecology that we refer to as the ‘ecological network dynamics framework’. This framework stresses that the interplay between species interaction networks and the spatial layout of habitat patches is key to identifying which network properties (number and weights of nodes and links) and trade-offs among them are needed to maintain species interactions in dynamic landscapes. We conclude that to be functional, ecological networks should be scaled according to species dispersal abilities in response to landscape heterogeneity. Determining how such effective ecological networks change through space and time can help reveal their complex dynamics in a changing world.