Limit of a nonpreferential attachment multitype network model

In order to meet passengers’ demands for increasing travel efficiency, the structure of China’s airport network will become more and more complex, and its operating environment has become more complex, so, it is important to measure the robustness of China’s airport network under the influence of complex disturbance factors. This paper proposes an airport network robustness analysis method based on the multi-layer temporal complex network model (MTNM) by introducing the time attribute. Firstly, we establish the network structure characteristics such as temporal degree, temporal closeness centrality (TC), and temporal betweenness centrality (TB) of airport network nodes, and take temporal network efficiency and temporal maximum connected subgraph as indicators; then inflection points of loss fitting curves for temporal network characteristics metrics under random attacks and deliberate attacks can be identified to evaluate network robustness. The results show that compared with static network, using multi-layer temporal network model can describe the performance characteristics of the network more accurately.

Searching for local communities is an important research challenge that allows for personalized community discovery and supports advanced data analysis in various complex networks, such as the World Wide Web, social networks, and brain networks. The evolution of these networks over time has motivated several recent studies to identify local communities in temporal networks. Given any query nodes, Community Search aims to find a densely connected subgraph containing query nodes. However, existing community search approaches in temporal networks have two main limitations: (1) they adopt pre-defined subgraph patterns to model communities, which cannot find communities that do not conform to these patterns in real-world networks, and (2) they only use the aggregation of disjoint structural information to measure quality, missing the dynamic of connections and temporal properties. In this paper, we propose a query-driven Temporal Graph Convolutional Network (CS-TGN) that can capture flexible community structures by learning from the ground-truth communities in a data-driven manner. CS-TGN first combines the local query-dependent structure and the global graph embedding in each snapshot of the network and then uses a GRU cell with contextual attention to learn the dynamics of interactions and update node embeddings over time. We demonstrate how this model can be used for interactive community search in an online setting, allowing users to evaluate the found communities and provide feedback. Experiments on real-world temporal graphs with ground-truth communities validate the superior quality of the solutions obtained and the efficiency of our model in both temporal and interactive static settings.

Many researchers from a variety of fields, including computer science, network science, and mathematics, have focused on how to contain the outbreaks of Internet misinformation that threaten social systems and undermine societal health. Most research on this topic treats the connections among individuals as static, but these connections change in time, and thus social networks are also temporal networks. Currently, there is no theoretical approach to the problem of containing misinformation outbreaks in temporal networks. We thus propose a misinformation spreading model for temporal networks and describe it using a new theoretical approach. We propose a heuristic-containing (HC) strategy based on optimizing the final outbreak size that outperforms simplified strategies such as those that are random-containing and targeted-containing. We verify the effectiveness of our HC strategy on both artificial and real-world networks by performing extensive numerical simulations and theoretical analyses. We find that the HC strategy dramatically increases the outbreak threshold and decreases the final outbreak threshold.

Dynamic centrality metrics provide a quantitative assessment of the strength of communication between nodes in temporal networks, as well as the overall capacity of the network for the efficient transmission of information. In this article, the behaviours of two variants of the ‘communicability’ metric are examined in simple null models of uncorrelated temporal networks. Analysis of the long-time behaviour of the null models reveals a simple trade-off in the role of the parameters of the metric, suggesting methods to calibrate parameters and to adapt to temporal variations in the network properties. The null models introduced address two main classes of temporal networks (contact sequences and interval graphs), and their predictions are compared and contrasted with results coming from real-world telecommunications data.

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm

Representation learning for temporal networks using temporal random walk and deep autoencoder

Many real-world complex systems are well represented as multilayer networks; predicting interactions in those systems is one of the most pressing problems in predictive network science. To address this challenge, we introduce two stochastic block models for multilayer and temporal networks; one of them uses nodes as its fundamental unit, whereas the other focuses on links. We also develop scalable algorithms for inferring the parameters of these models. Because our models describe all layers simultaneously, our approach takes full advantage of the information contained in the whole network when making predictions about any particular layer. We illustrate the potential of our approach by analyzing two empirical data sets: a temporal network of e-mail communications, and a network of drug interactions for treating different cancer types. We find that multilayer models consistently outperform their single-layer counterparts, but that the most predictive model depends on the data set under consideration; whereas the node-based model is more appropriate for predicting drug interactions, the link-based model is more appropriate for predicting e-mail communication.

Identifying important nodes in complex networks is a fundamental problem in network analysis. Although a plethora of measures has been proposed to identify important nodes in static (i.e., time-invariant) networks, there is a lack of tools in the context of temporal networks (i.e., networks whose connectivity dynamically changes over time). The aim of this paper is to propose a system-theoretic approach for identifying important nodes in temporal networks. In this direction, we first propose a generalization of the popular Katz centrality measure to the family of Markovian temporal networks using tools from the theory of Markov jump linear systems. We then show that Katz centrality in Markovian temporal networks can be efficiently computed using linear programming. Finally, we propose a convex program for optimizing the Katz centrality of a given node by tuning the weights of the temporal network in a cost-efficient manner. Numerical simulations illustrate the effectiveness of the obtained results.

In the new media environment, the constantly emerging social platforms further expand the channels for the propagation of public opinion. Under the framework of complex network theory and faced the needs of management practice, modeling the spreading dynamics of public opinion in temporal group networks is of great significance for understanding its spreading law and improving the governance system of cyberspace and the development of network science. Through analyzing the changes of group networks topology and the spreading rules of public opinion, the spreading model of public opinion in temporal group networks was proposed by coupling the two dynamic processes, and the spreading thresholds of public opinion in static and temporal group networks were derived respectively. Then, the spreading characteristics of public opinion under different network topology, as well as the influence of important parameters on public opinion spreading process were discussed with the help of simulation experiments. The research results indicated that the propagation of public opinion in static and temporal group networks exhibits both similar trends and differentiated characteristics; compared with Spreader, the propagation of public opinion in temporal group networks is more sensitive to Ignorant’s behavior; both groups’ and netizens’ active probability have significant influence on public opinion propagation, but netizens’ affects more. Based on the relevant results, this paper proposed a series of countermeasures such as, grading social platforms, strengthening relationship management between them and introducing time management systems, so as to promote the formation of a good network ecosystem and the modernization of the national governance system.

This chapter presents the existing modelling frameworks for multiplex and multilayer networks. Multiplex network models are divided into growing multiplex network models and null models of multiplex networks. Growing multiplex networks are here shown to explain the main dynamical rules responsible to the emergent properties of multiplex networks, including the scale-free degree distribution, interlayer degree correlations and multilayer communities. Null models of multiplex networks are described in the context of maximum-entropy multiplex network ensembles. Randomization algorithms to test the relevant of network properties against null models are here described. Moreover, Multi-slice temporal networks Models capturing main properties of real temporal network data are presented. Finally, null models of general multilayer networks and networks of networks are characterized.

C-Group is a tool for analyzing dynamic group membership in temporal social networks over time. Unlike most network visualization tools, which show the group structure within an entire network, or the group membership for a single actor, C-Group allows users to focus their analysis on a pair of individuals. While C-Group allows for viewing the addition and deletion of nodes (actors) and edges (relationships) over time, its major contribution is its focus on changing group memberships over time. By doing so, users can investigate the context of temporal group memberships for the pair. C-Group provides users with a flexible interface for defining (and redefining) groups interactively, and supports two novel visual representations of the evolving group memberships. This flexibility gives users alternate views that are appropriate for different network sizes and provides users with different insights into the grouping behavior. We demonstrate the utility of the tool on a scientific publication network.

In this study, we introduce a novel approach to speech enhancement through the design of a complex temporal convolutional network (Complex-TCN). This model leverages the power of complex networks, enabling the simultaneous capture of both magnitude and phase information inherent in speech signals. By employing a temporal convolutional network, the Complex-TCN excels at extracting contextual information within the time domain of speech. Our findings underscore the substantial performance improvements achieved through the synergistic use of the temporal convolutional network and the incorporation of complex representations.

With the development and popularization of online shopping, a large number of commodities on the online retail platform should be managed through the multilevel category system, in which there are thousands of categories. Automatic commodity classification has become an issue. Classifying commodities according to their text titles can improve the efficiency of online retail platforms. The text titles of commodities contain the information of commodities, but the text titles seldom follow the grammar rules and the text length varies greatly. We propose a classification model, Temporal Multiple-Convolutional Network (TMN), which combines Temporal Convolutional Network(TCN) model and Multiple-Convolutional Neural Network(MCNN) model. The TCN model is firstly used to model sequence data based on both word embedding and character embedding respectively, and generate two output vectors. Then, the MCNN models are used to extract features from the abstract vectors. Finally, output layer employs softmax function to classify commodities. We conduct experiment on the online retail platform dataset provided by Inspur Group Co., Ltd. The results show that the TMN has a commodity classification accuracy of 84.2%, which is superior to that of state-of-the-art models.

Veg-W2TCN: A parallel hybrid forecasting framework for non-stationary time series using wavelet and temporal convolution network model

Accurate short-term GHI forecasting using a novel temporal convolutional network model