Major impact of queue-rule choice on the performance of dynamic networks with limited buffer size

We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In our network model,nodes move at each time step.Packets are transmitted by an adaptive routing strategy,combining Euclidean distance and node load by a tunable parameter.Because of this routing strategy,at the initial stage of increasing buffer size,the network density will increase,and the packet loss rate will decrease.Packet loss and traffic congestion occur by these three rules,but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks.If packets are lost and traffic congestion occurs,different dynamic characteristics are shown by these three queue rules.Moreover,a phenomenon similar to Braess’paradox is also found by the LIFO rule and the RIRO rule.

Influencer identification of dynamical networks based on an information entropy dimension reduction method

Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.

Target layer state estimation in multi-layer complex dynamical networks considering nonlinear node dynamics

In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation of target state variables in multi-layer complex dynamical networks with nonlinear node dynamics is studied.A suitable functional state observer is constructed with the limited measurement.The parameters of the designed functional observer are obtained from the algebraic method and the stability of the functional observer is proven by the Lyapunov theorem.Some necessary conditions that need to be satisfied for the design of the functional state observer are obtained.Different from previous studies, in the multi-layer complex dynamical network with nonlinear node dynamics, the proposed method can estimate the state of target variables on some layers directly instead of estimating all the individual states.Thus, it can greatly reduce the placement of observers and computational cost.Numerical simulations with the three-layer complex dynamical network composed of three-dimensional nonlinear dynamical nodes are developed to verify the effectiveness of the method.

Study on Ecological Change Remote Sensing Monitoring Method Based on Elman Dynamic Recurrent Neural Network

In this paper, Hailin City of Heilongjiang Province, China is taken as the research area. As an important city in Heilongjiang Province, China, the sustainable development of its ecological environment is related to the opening up, economic prosperity and social stability of Northeast China. In this paper, the remote sensing ecological index (RSEI) of Hailin City in recent 20 years was calculated by using Landsat 5/8/9 series satellite images, and the temporal and spatial changes of the ecological environment in Hailin City were further analyzed and the influencing factors were discussed. From 2003 to 2023, the mean value of RSEI in Hailin City decreased and increased, and the ecological environment decreased slightly as a whole. RSEI declined most significantly from 2003 to 2008, and it increased from 2008 to 2013, decreased from 2013 to 2018, and increased from 2018 to 2023 again, with higher RSEI value in the south and lower RSEI value in the northwest. It is suggested to appropriately increase vegetation coverage in the northwest to improve ecological quality. As a result, the predicted value of Elman dynamic recurrent neural network model is consistent with the change trend of the mean value, and the prediction error converges quickly, which can accurately predict the ecological environment quality in the future study area.

Cryptocurrency Transaction Network Embedding From Static and Dynamic Perspectives: An Overview

Cryptocurrency, as a typical application scene of blockchain, has attracted broad interests from both industrial and academic communities. With its rapid development, the cryptocurrency transaction network embedding(CTNE) has become a hot topic. It embeds transaction nodes into low-dimensional feature space while effectively maintaining a network structure,thereby discovering desired patterns demonstrating involved users' normal and abnormal behaviors. Based on a wide investigation into the state-of-the-art CTNE, this survey has made the following efforts: 1) categorizing recent progress of CTNE methods, 2) summarizing the publicly available cryptocurrency transaction network datasets, 3) evaluating several widely-adopted methods to show their performance in several typical evaluation protocols, and 4) discussing the future trends of CTNE. By doing so, it strives to provide a systematic and comprehensive overview of existing CTNE methods from static to dynamic perspectives,thereby promoting further research into this emerging and important field.

Algebraic form and analysis of SIR epidemic dynamics over probabilistic dynamic networks

The outbreak of corona virus disease 2019 has profoundly affected people’s way of life.It is increasingly necessary to investigate epidemics over social networks.This paper studies susceptible-infected-removed(SIR)epidemics via the semi-tensor product.First,a formal susceptible-infected-removed epidemic dynamic model over probabilistic dynamic networks(SIRED-PDN)is given.Based on an evolutionary rule,the algebraic form for the dynamics of individual states and network topologies is given,respectively.Second,the SIRED-PDN can be described by a probabilistic mix-valued logical network.After providing an algorithm,all possible final spreading equilibria can be obtained for any given initial epidemic state and network topology by seeking attractors of the network.And the shortest time for all possible initial epidemic state and network topology profiles to evolve to the final spreading equilibria can be obtained by seeking the transient time of the network.Finally,an illustrative example is given to show the effectiveness of our model.

Visual abstraction of dynamic network via improved multi-class blue noise sampling

Massive sequence view (MSV) is a classic timeline-based dynamic network visualization approach. However, it is vulnerable to visual clutter caused by overlapping edges, thereby leading to unexpected misunderstanding of time-varying trends of network communications. This study presents a new edge sampling algorithm called edge-based multi-class blue noise (E-MCBN) to reduce visual clutter in MSV. Our main idea is inspired by the multi-class blue noise (MCBN) sampling algorithm, commonly used in multi-class scatterplot decluttering. First, we take a node pair as an edge class, which can be regarded as an analogy to classes in multi-class scatterplots. Second, we propose two indicators, namely, class overlap and inter-class conflict degrees, to measure the overlapping degree and mutual exclusion, respectively, between edge classes. These indicators help construct the foundation of migrating the MCBN sampling from multi-class scatterplots to dynamic network samplings. Finally, we propose three strategies to accelerate MCBN sampling and a partitioning strategy to preserve local high-density edges in the MSV. The result shows that our approach can effectively reduce visual clutters and improve the readability of MSV. Moreover, our approach can also overcome the disadvantages of the MCBN sampling (i.e., long-running and failure to preserve local high-density communication areas in MSV). This study is the first that introduces MCBN sampling into a dynamic network sampling.

Analysis of rockburst mechanism and warning based on microseismic moment tensors and dynamic Bayesian networks

One of the major factors inhibiting the construction of deep underground projects is the risk posed by rockbursts.A study was conducted on the access tunnel of the Shuangjiangkou hydropower station to determine the evolutionary mechanism of microfractures within the surrounding rock mass during rockburst development and develop a rockburst warning model.The study area was chosen through the combination of field studies with an analysis of the spatial and temporal distribution of microseismic(MS)events.The moment tensor inversion method was adopted to study rockburst mechanism,and a dynamic Bayesian network(DBN)was applied to investigating the sensitivity of MS source parameters for rockburst warnings.A MS multivariable rockburst warning model was proposed and validated using two case studies.The results indicate that fractures in the surrounding rock mass during the development of strain-structure rockbursts initially show shear failure and are then followed by tensile failure.The effectiveness of the DBN-based rockburst warning model was demonstrated using self-validation and K-fold cross-validation.Moment magnitude and source radius are the most sensitive factors based on an investigation of the influence on the parent and child nodes in the model,which can serve as important standards for rockburst warnings.The proposed rockburst warning model was found to be effective when applied to two actual projects.

A reconfigurable dynamic Bayesian network for digital twin modeling of structures with multiple damage modes

Dynamic Bayesian networks(DBNs)are commonly employed for structural digital twin modeling.At present,most researches only consider single damage mode tracking.It is not sufficient for a reusable spacecraft as various damage modes may occur during its service life.A reconfigurable DBN method is proposed in this paper.The structure of the DBN can be updated dynamically to describe the interactions between different damages.Two common damages(fatigue and bolt loosening)for a spacecraft structure are considered in a numerical example.The results show that the reconfigurable DBN can accurately predict the acceleration phenomenon of crack growth caused by bolt loosening while the DBN with time-invariant structure cannot,even with enough updates.The definition of interaction coefficients makes the reconfigurable DBN easy to track multiple damages and be extended to more complex problems.The method also has a good physical interpretability as the reconfiguration of DBN corresponds to a specific mechanism.Satisfactory predictions do not require precise knowledge of reconfiguration conditions,making the method more practical.

Reliability analysis for wireless communication networks via dynamic Bayesian network

The dynamic wireless communication network is a complex network that needs to consider various influence factors including communication devices,radio propagation,network topology,and dynamic behaviors.Existing works focus on suggesting simplified reliability analysis methods for these dynamic networks.As one of the most popular modeling methodologies,the dynamic Bayesian network(DBN)is proposed.However,it is insufficient for the wireless communication network which contains temporal and non-temporal events.To this end,we present a modeling methodology for a generalized continuous time Bayesian network(CTBN)with a 2-state conditional probability table(CPT).Moreover,a comprehensive reliability analysis method for communication devices and radio propagation is suggested.The proposed methodology is verified by a reliability analysis of a real wireless communication network.

Research on Weighted Directed Dynamic Multiplexing Network of World Grain Trade Based on Improved MLP Framework

As the main food source for humans, the global movement of the three major grains significantly impacts human survival and development. To investigate the evolution of the world cereal trade network and its development trend, a weighted directed dynamic multiplexed network was established using historical data on cereal trade, cereal import dependency ratio, and arable land per capita. Inspired by the MLP framework, we redefined the weight determination method for computing layer weights and edge weights of the target layer, modified the CN, RA, AA, and PA indicators, and proposed the node similarity indicator for weighted directed networks. The AUC metric, which measures the accuracy of the algorithm, has also been improved in order to finally obtain the link prediction results for the grain trading network. The prediction results were processed, such as web-based presentation and community partition. It was found that the number of generalized trade agreements does not have a decisive impact on inter-country cereal trade. The former large grain exporters continue to play an important role in this trade network. In the future, the world trade in cereals will develop in the direction of more frequent intercontinental trade and gradually weaken the intracontinental cereal trade.

Force-Based Incremental Algorithm for Mining Community Structure in Dynamic Network

Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.

Matrix expression and vaccination control for epidemic dynamics over dynamic networks

This paper investigates epidemic dynamics over dynamic networks via the approach of semi-tensor product of matrices. First, a formal susceptible-infected-susceptible epidemic dynamic model over dynamic networks （SISED-DN） is given. Second, based on a class of determinate co-evolutionary rule, the matrix expressions are established for the dynamics of individual states and network topologies, respectively. Then, all possible final spreading equilibria are obtained for any given initial epidemic state and network topology by the matrix expression. Third, a sufficient and necessary condition of the existence of state feedback vaccination control is presented to make every individual susceptible. The study of illustrative examples shows the effectiveness of our new results.

Second-order consensus in networks of dynamic agents with communication time-delays

This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.

A Fault-Tolerant Routing Scheme in Dynamic Networks

In dynamic networks, links and nodes will be deleted or added regularly. It is very essential for the routing scheme to have the ability of fault-tolerance. The method to achieve such a goal is to generate more than one path for a given set of source and destination. In this paper, the idea of interval routing is used to construct a new scheme (Multi-Node Label Interval Routing scheme, or MNLIR scheme) to realize fault-tolerance. Interval routing is a space-efficient routing method for networks, but the method is static and determinative, and it cannot realize faulttolerance. In MNLIR scheme some nodes will have more than one label, thus some pairs of destination and source will have more than one path; the pairs of nodes, which have inheritance relation, will have the shortest path. Using this character, MNLIR scheme has better overall routing performance than the former interval routing scheme, which can be proven by simulations. The common problem concerning the insertion and deletion of nodes and links is considered in this paper. So if the networks have some changes in topology, MNLIR scheme may find alternative path for certain pairs of nodes. In this way, fault-tolerance can be realized with only a little space added to store the multi-node labels.

iNet:visual analysis of irregular transition in multivariate dynamic networks

Multivariate dynamic networks indicate networks whose topology structure and vertex attributes are evolving along time.They are common in multimedia applications.Anomaly detection is one of the essential tasks in analyzing these networks though it is not well addressed.In this paper,we combine a rare category detection method and visualization techniques to help users to identify and analyze anomalies in multivariate dynamic networks.We conclude features of rare categories and two types of anomalies of rare categories.Then we present a novel rare category detection method,called DIRAD,to detect rare category candidates with anomalies.We develop a prototype system called iNet,which integrates two major visualization components,including a glyph-based rare category identifier,which helps users to identify rare categories among detected substructures,a major view,which assists users to analyze and interpret the anomalies of rare categories in network topology and vertex attributes.Evaluations,including an algorithm performance evaluation,a case study,and a user study,are conducted to test the effectiveness of proposed methods.

Molecular biomarkers,network biomarkers,and dynamic network biomarkers for diagnosis and prediction of rare diseases

The difficulty of converting scientific research findings into novel pharmacological treatments for rare and life-threatening diseases is enormous.Biomarkers related to multiple biological processes involved in cell growth,proliferation,and disease occurrence have been identified in recent years with the development of immunology,molecular biology,and genomics technologies.Biomarkers are capable of reflecting normal physiological processes,pathological processes,and the response to therapeutic intervention;as such,they play vital roles in disease diagnosis,prevention,drug response,and other aspects of biomedicine.The discovery of valuable biomarkers has become a focal point of current research.Numerous studies have identified molecular biomarkers based on the differential expression/concentration of molecules(e.g.,genes/proteins)for disease state diagnosis,characterization,and treatment.Although technological breakthroughs in molecular analysis platforms have enabled the identification of a large number of candidate biomarkers for rare diseases,only a small number of these candidates have been properly validated for use in patient treatment.The traditional molecular biomarkers may lose vital information by ignoring molecular associations/interactions,and thus the concept of network biomarkers based on differential associations/correlations of molecule pairs has been established.This approach promises to be more stable and reliable in diagnosing disease states.Furthermore,the newly-emerged dynamic network biomarkers(DNBs)based on differential fluctuations/correlations of molecular groups are able to recognize pre-disease states or critical states instead of disease states,thereby achieving rare disease prediction or predictive/preventative medicine and providing deep insight into the dynamic characteristics of disease initiation and progression.

TCMATHF:a bioinformatics platform to predict pharmacological action of drug and dynamic molecular changes against from myocardial infarction to heart failure

OBJECTIVE To investigate the characteristics and regulations of medication in different stages of disease by constructing a dynamic disease network and a cellular feature network spanning from myocardial infarction to heart failure.METHODS Based on transcrip⁃tome and single-cell sequencing data from a mouse model of left anterior descending coro⁃nary artery ligation,a dynamic early-middle-late network and cellular feature network were con⁃structed by integrating differential gene expres⁃sion trends and biological functions.The robust⁃ness of the perturbation effect of traditional Chi⁃nese medicine(TCM)on the disease network was calculated based on multi-target TCM,and we acquired the foundational data by analyzing the results of effectiveness.The predictive plat⁃form was scrutinized and assessed with regards to the functional attributes of FDA approveddrugs and compound prescriptions,in order to determine the primary stages of intervention and the drug patterns actions in the progression of heart failure.RESULTS In this study,we devel⁃oped a prediction and analysis platform for assessing the efficacy of drugs using a networkbased approach.The accuracy of the system was validated by FDA approved-drugs.It was found that blood-activating drugs,heat-clearing drugs,and phlegm-expelling drugs exhibited favorable intervention effects during the early to middle stages of the disease by investigating the effects of single herbs and TCM prescriptions on disease progression.Similarly,phlegm-expelling drugs,spirit-nourishing drugs,and diuretic showed better intervention effects during the mid⁃dle to late stages.These findings were consis⁃tent with the clinical use of drugs.Analysis of the clustering heatmap results of TCM prescriptions revealed that the formulas aimed at qi stagnation and blood stasis had a strong effect in early stage,while the formulas for qi and yin deficiency and cardiorenal yang deficiency had a strong effect in the middle to late stages.Furthermore,analysis of the single-cell feature network demon⁃strated that TCM had advantages in modulating the changes in fibroblasts,myofibroblasts,endo⁃thelial cells,and granulocytes during the patho⁃logical process.Additionally,most prescriptions exhibited strong perturbation effects on the fea⁃ture network of NK-T cells,granulocytes,macro⁃phages,and myofibroblasts.CONCLUSION This platform quantitatively evaluates the primary action stages and characteristics of TCM and for⁃mulas involved in the dynamic process of myo⁃cardial infarction to heart failure based on the effective prediction of the efficacy of TCM and FDA approved-drugs.It provides reference for the precise clinical application of TCM and formu⁃las with multiple targets and multiple pathways.

Synchronization of complex switched delay dynamical networks with simultaneously diagonalizable coupling matrices

This paper studies local exponential synchronization of complex delayed networks with switching topology via switched system stability theory. First, by a common unitary matrix, the problem of synchronization is transformed into the stability analysis of some linear switched delay systems. Then, when all subnetworks are synchronizable, a delay-dependent sufficient condition is given in terms of linear matrix inequalities （LMIs） which guarantees the solvability of the synchronization problem under an average dwell time scheme. We extend this result to the case that not all subnetworks are synchronizable. It is shown that in addition to average dwell time, if the ratio of the total activation time of synchronizable and non-synchronizable subnetworks satisfy an extra condition, then the problem is also solvable. Two numerical examples of delayed dynamical networks with switching topology are given, which demonstrate the effectiveness of obtained results.

SYNCHRONIZATION OF MASTER-SLAVE MARKOVIAN SWITCHING COMPLEX DYNAMICAL NETWORKS WITH TIME-VARYING DELAYS IN NONLINEAR FUNCTION VIA SLIDING MODE CONTROL

In this article, a synchronization problem for master-slave Markovian switching complex dynamical networks with time-varying delays in nonlinear function via sliding mode control is investigated. On the basis of the appropriate Lyapunov-Krasovskii functional, introducing some free weighting matrices, new synchronization criteria are derived in terms of linear matrix inequalities （LMIs）. Then, an integral sliding surface is designed to guarantee synchronization of master-slave Markovian switching complex dynamical networks, and the suitable controller is synthesized to ensure that the trajectory of the closed-loop error system can be driven onto the prescribed sliding mode surface. By using Dynkin＇s formula, we established the stochastic stablity of master-slave system. Finally, numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.