This paper investigates the problem of cluster synchronization of master-slave complex net-works with time-varying delay via linear and adaptive feedback pinning controls.We need not non-delayed and delayed coupling m...This paper investigates the problem of cluster synchronization of master-slave complex net-works with time-varying delay via linear and adaptive feedback pinning controls.We need not non-delayed and delayed coupling matrices to be symmetric or irreducible.We have the advantages of using adaptive control method to reduce control gain and pinning control technology to reduce cost.By con-structing Lyapunov function,some sufficient synchronization criteria are established.Finally,numerical examples are employed to illustrate the effectiveness of the proposed approach.展开更多
This paper investigates modified fixed-time synchronization(FxTS)of complex networks(CNs)with time-varying delays based on continuous and discontinuous controllers.First,for the sake of making the settling time(ST)of ...This paper investigates modified fixed-time synchronization(FxTS)of complex networks(CNs)with time-varying delays based on continuous and discontinuous controllers.First,for the sake of making the settling time(ST)of FxTS is independent of the initial values and parameters of the CNs,a modified fixed-time(FxT)stability theorem is proposed,where the ST is determined by an arbitrary positive number given in advance.Then,continuous controller and discontinuous controller are designed to realize the modified FxTS target of CNs.In addition,based on the designed controllers,CNs can achieve synchronization at any given time,or even earlier.And control strategies effectively solve the problem of ST related to the parameters of CNs.Finally,an appropriate simulation example is conducted to examine the effectiveness of the designed control strategies.展开更多
Independent cascade(IC)models,by simulating how one node can activate another,are important tools for studying the dynamics of information spreading in complex networks.However,traditional algorithms for the IC model ...Independent cascade(IC)models,by simulating how one node can activate another,are important tools for studying the dynamics of information spreading in complex networks.However,traditional algorithms for the IC model implementation face significant efficiency bottlenecks when dealing with large-scale networks and multi-round simulations.To settle this problem,this study introduces a GPU-based parallel independent cascade(GPIC)algorithm,featuring an optimized representation of the network data structure and parallel task scheduling strategies.Specifically,for this GPIC algorithm,we propose a network data structure tailored for GPU processing,thereby enhancing the computational efficiency and the scalability of the IC model.In addition,we design a parallel framework that utilizes the full potential of GPU's parallel processing capabilities,thereby augmenting the computational efficiency.The results from our simulation experiments demonstrate that GPIC not only preserves accuracy but also significantly boosts efficiency,achieving a speedup factor of 129 when compared to the baseline IC method.Our experiments also reveal that when using GPIC for the independent cascade simulation,100-200 simulation rounds are sufficient for higher-cost studies,while high precision studies benefit from 500 rounds to ensure reliable results,providing empirical guidance for applying this new algorithm to practical research.展开更多
Accurately identifying key nodes is essential for evaluating network robustness and controlling information propagation in complex network analysis. However, current research methods face limitations in applicability ...Accurately identifying key nodes is essential for evaluating network robustness and controlling information propagation in complex network analysis. However, current research methods face limitations in applicability and accuracy. To address these challenges, this study introduces the K-GCN model, which integrates neighborhood k-shell distribution analysis with Graph Convolutional Network(GCN) technology to enhance key node identification in complex networks. The K-GCN model first leverages neighborhood k-shell distributions to calculate entropy values for each node, effectively quantifying node importance within the network. These entropy values are then used as key features within the GCN, which subsequently formulates intelligent strategies to maximize network connectivity disruption by removing a minimal set of nodes, thereby impacting the overall network architecture. Through iterative interactions with the environment, the GCN continuously refines its strategies, achieving precise identification of key nodes in the network. Unlike traditional methods, the K-GCN model not only captures local node features but also integrates the network structure and complex interrelations between neighboring nodes, significantly improving the accuracy and efficiency of key node identification.Experimental validation in multiple real-world network scenarios demonstrates that the K-GCN model outperforms existing methods.展开更多
This paper investigates a new SEIQR(susceptible–exposed–infected–quarantined–recovered) epidemic model with quarantine mechanism on heterogeneous complex networks. Firstly, the nonlinear SEIQR epidemic spreading d...This paper investigates a new SEIQR(susceptible–exposed–infected–quarantined–recovered) epidemic model with quarantine mechanism on heterogeneous complex networks. Firstly, the nonlinear SEIQR epidemic spreading dynamic differential coupling model is proposed. Then, by using mean-field theory and the next-generation matrix method, the equilibriums and basic reproduction number are derived. Theoretical results indicate that the basic reproduction number significantly relies on model parameters and topology of the underlying networks. In addition, the globally asymptotic stability of equilibrium and the permanence of the disease are proved in detail by the Routh–Hurwitz criterion, Lyapunov method and La Salle's invariance principle. Furthermore, we find that the quarantine mechanism, that is the quarantine rate(γ1, γ2), has a significant effect on epidemic spreading through sensitivity analysis of basic reproduction number and model parameters. Meanwhile, the optimal control model of quarantined rate and analysis method are proposed, which can optimize the government control strategies and reduce the number of infected individual. Finally, numerical simulations are given to verify the correctness of theoretical results and a practice application is proposed to predict and control the spreading of COVID-19.展开更多
This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid s...This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid synchronization of heterogeneous duplex complex networks.Therefore,we study the finite time hybrid synchronization of heterogeneous duplex networks,which employs the time-varying intermittent control to drive the duplex heterogeneous complex networks to achieve hybrid synchronization in finite time.To be specific,the switch frequency of the controllers can be changed with time by devise Lyapunov function and boundary function,the internal synchronization and external synchronization are achieved simultaneously in finite time.Finally,numerical examples are presented to illustrate the validness of theoretical results.展开更多
The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate disseminatio...The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments.Although there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved.In this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times.The proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread duration.The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming.Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency.Furthermore,we find that our method maintains robustness irrespective of the number of sources and the average degree of network.Compared with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.展开更多
We construct a dual-layer coupled complex network of communities and residents to represent the interconnected risk transmission network between communities and the disease transmission network among residents. It cha...We construct a dual-layer coupled complex network of communities and residents to represent the interconnected risk transmission network between communities and the disease transmission network among residents. It characterizes the process of infectious disease transmission among residents between communities through the SE2IHR model considering two types of infectors. By depicting a more fine-grained social structure and combining further simulation experiments, the study validates the crucial role of various prevention and control measures implemented by communities as primary executors in controlling the epidemic. Research shows that the geographical boundaries of communities and the social interaction patterns of residents have a significant impact on the spread of the epidemic, where early detection, isolation and treatment strategies at community level are essential for controlling the spread of the epidemic. In addition, the study explores the collaborative governance model and institutional advantages of communities and residents in epidemic prevention and control.展开更多
The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered ...The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered mechanism(DETM).In order to optimize communication resource utilization,the DETM is employed to determine whether the current measurement data should be transmitted to the estimator or not.To guarantee a satisfactory estimation performance for the fault signal,an unknown-input-observer-based estimator is constructed to decouple the estimation error dynamics from the influence of fault signals.The aim of this paper is to find the suitable estimator parameters under the effects of DETM such that both the state estimates and fault estimates are confined within two sets of closed ellipsoid domains.The techniques of recursive matrix inequality are applied to derive sufficient conditions for the existence of the desired estimator,ensuring that the specified performance requirements are met under certain conditions.Then,the estimator gains are derived by minimizing the ellipsoid domain in the sense of trace and a recursive estimator parameter design algorithm is then provided.Finally,a numerical example is conducted to demonstrate the effectiveness of the designed estimator.展开更多
One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms...One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms focus on single feature or manually extract the attributes,which occasionally results in the failure to fully capture the vertex’s importance.A new vertex centrality approach based on symmetric nonnegative matrix factorization(SNMF),called VCSNMF,is proposed in this paper.For highlight the characteristics of a network,the adjacency matrix and the degree matrix are fused to represent original data of the network via a weighted linear combination.First,SNMF automatically extracts the latent characteristics of vertices by factorizing the established original data matrix.Then we prove that each vertex’s composite feature which is constructed with one-dimensional factor matrix can be approximated as the term of eigenvector associated with the spectral radius of the network,otherwise obtained by the factor matrix on the hyperspace.Finally,VCSNMF integrates the composite feature and the topological structure to evaluate the performance of vertices.To verify the effectiveness of the VCSNMF criterion,eight existing centrality approaches are used as comparison measures to rank influential vertices in ten real-world networks.The experimental results assert the superiority of the method.展开更多
According to news reports on severe earthquakes since 2008,a total of 51 cases with magnitudes of 6.0 or above were analyzed,and 14 frequently occurring secondary disasters were identified.A disaster chain model was d...According to news reports on severe earthquakes since 2008,a total of 51 cases with magnitudes of 6.0 or above were analyzed,and 14 frequently occurring secondary disasters were identified.A disaster chain model was developed using principles from complex network theory.The vulnerability and risk level of each edge in this model were calculated,and high-risk edges and disaster chains were identified.The analysis reveals that the edge“floods→building collapses”has the highest vulnerability.Implementing measures to mitigate this edge is crucial for delaying the spread of secondary disasters.The highest risk is associated with the edge“building collapses→casualties,”and increased risks are also identified for chains such as“earthquake→building collapses→casualties,”“earthquake→landslides and debris flows→dammed lakes,”and“dammed lakes→floods→building collapses.”Following an earthquake,the prompt implementation of measures is crucial to effectively disrupt these chains and minimize the damage from secondary disasters.展开更多
To resolve the ontology understanding problem, the structural features and the potential important terms of a large-scale ontology are investigated from the perspective of complex networks analysis. Through the empiri...To resolve the ontology understanding problem, the structural features and the potential important terms of a large-scale ontology are investigated from the perspective of complex networks analysis. Through the empirical studies of the gene ontology with various perspectives, this paper shows that the whole gene ontology displays the same topological features as complex networks including ＂small world＂ and ＂scale-free＂,while some sub-ontologies have the ＂scale-free＂ property but no ＂small world＂ effect.The potential important terms in an ontology are discovered by some famous complex network centralization methods.An evaluation method based on information retrieval in MEDLINE is designed to measure the effectiveness of the discovered important terms.According to the relevant literature of the gene ontology terms,the suitability of these centralization methods for ontology important concepts discovering is quantitatively evaluated.The experimental results indicate that the betweenness centrality is the most appropriate method among all the evaluated centralization measures.展开更多
Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degr...Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centra- lity and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.展开更多
A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similar...A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.展开更多
Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accele...Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accelerating information diffusion.The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity.Moreover,they do not take into account the impact of network topology evolution over time,resulting in limitations in some applications.Based on local information of networks,a local clustering H-index(LCH)centrality measure is proposed,which considers neighborhood topology,the quantity and quality of neighbor nodes simultaneously.The proposed measure only needs the information of first-order and second-order neighbor nodes of networks,thus it has nearly linear time complexity and can be applicable to large-scale networks.In order to test the proposed measure,we adopt the susceptible-infected-recovered(SIR)and susceptible-infected(SI)models to simulate the spreading process.A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.展开更多
The problem of exponential synchronization for a class of general complex dynamical networks with nonlinear coupling delays by adaptive pinning periodically intermittent control is considered in this paper. We use the...The problem of exponential synchronization for a class of general complex dynamical networks with nonlinear coupling delays by adaptive pinning periodically intermittent control is considered in this paper. We use the methods of the adaptive control, pinning control and periodically intermittent control. Based on the piecewise Lyapunov stability theory, some less conservative criteria are derived for the global exponential synchronization of the complex dynamical networks with coupling delays. And several corresponding adaptive pinning feedback synchronization controllers are designed. These controllers have strong robustness against the coupling strength and topological structure of the network. Using the delayed nonlinear system as the nodes of the networks, a numerical example of the complex dynamical networks with nonlinear coupling delays is given to demonstrate the effectiveness of the control strategy.展开更多
In this paper, a dynamic epidemic control model on the uncorrelated complex networks is proposed. By means of theoretical analysis, we found that the new model has a similar epidemic threshold as that of the susceptib...In this paper, a dynamic epidemic control model on the uncorrelated complex networks is proposed. By means of theoretical analysis, we found that the new model has a similar epidemic threshold as that of the susceptible-infectedrecovered （SIR） model on the above networks, but it can reduce the prevalence of the infected individuals remarkably. This result may help us understand epidemic spreading phenomena on real networks and design appropriate strategies to control infections.展开更多
In this paper,a sexually transmitted disease model is proposed on complex networks,where contacts between humans are treated as a scale-free social network.There are three groups in our model,which are dangerous male,...In this paper,a sexually transmitted disease model is proposed on complex networks,where contacts between humans are treated as a scale-free social network.There are three groups in our model,which are dangerous male,non-dangerous male,and female.By mathematical analysis,we obtain the basic reproduction number for the existence of endemic equilibrium and study the effects of various immunization schemes about different groups.Furthermore,numerical simulations are undertaken to verify more conclusions.展开更多
Identifying influential nodes in complex networks is essential for network robust and stability,such as viral marketing and information control.Various methods have been proposed to define the influence of nodes.In th...Identifying influential nodes in complex networks is essential for network robust and stability,such as viral marketing and information control.Various methods have been proposed to define the influence of nodes.In this paper,we comprehensively consider the global position and local structure to identify influential nodes.The number of iterations in the process of k-shell decomposition is taken into consideration,and the improved k-shell decomposition is then put forward.The improved k-shell decomposition and degree of target node are taken as the benchmark centrality,in addition,as is well known,the effect between node pairs is inversely proportional to the shortest path length between two nodes,and then we also consider the effect of neighbors on target node.To evaluate the performance of the proposed method,susceptible-infected(SI)model is adopted to simulate the spreading process in four real networks,and the experimental results show that the proposed method has obvious advantages over classical centrality measures in identifying influential nodes.展开更多
We analyze the correlation properties of the Erd6s-Rdnyi random graph （RG） and the Barabdsi-Albert scale-free network （SF） under the attack and repair strategy with detrended fluctuation analysis （DFA）. The maxi...We analyze the correlation properties of the Erd6s-Rdnyi random graph （RG） and the Barabdsi-Albert scale-free network （SF） under the attack and repair strategy with detrended fluctuation analysis （DFA）. The maximum degree kmax, representing the local property of the system, shows similar scaling behaviors for random graphs and scale-free networks. The fluctuations are quite random at short time scales but display strong anticorrelation at longer time scales under the same system size N and different repair probability pre. The average degree 〈k〉, revealing the statistical property of the system, exhibits completely different scaling behaviors for random graphs and scale-free networks. Random graphs display long-range power-law correlations. Scale-free networks are uncorrelated at short time scales; while anticorrelated at longer time scales and the anticorrelation becoming stronger with the increase of pre.展开更多
文摘This paper investigates the problem of cluster synchronization of master-slave complex net-works with time-varying delay via linear and adaptive feedback pinning controls.We need not non-delayed and delayed coupling matrices to be symmetric or irreducible.We have the advantages of using adaptive control method to reduce control gain and pinning control technology to reduce cost.By con-structing Lyapunov function,some sufficient synchronization criteria are established.Finally,numerical examples are employed to illustrate the effectiveness of the proposed approach.
基金Supported by the National Natural Science Foundation of China(62476082)。
文摘This paper investigates modified fixed-time synchronization(FxTS)of complex networks(CNs)with time-varying delays based on continuous and discontinuous controllers.First,for the sake of making the settling time(ST)of FxTS is independent of the initial values and parameters of the CNs,a modified fixed-time(FxT)stability theorem is proposed,where the ST is determined by an arbitrary positive number given in advance.Then,continuous controller and discontinuous controller are designed to realize the modified FxTS target of CNs.In addition,based on the designed controllers,CNs can achieve synchronization at any given time,or even earlier.And control strategies effectively solve the problem of ST related to the parameters of CNs.Finally,an appropriate simulation example is conducted to examine the effectiveness of the designed control strategies.
基金support from the National Natural Science Foundation of China(Grant No.T2293771)the STI 2030-Major Projects(Grant No.2022ZD0211400)the Sichuan Province Outstanding Young Scientists Foundation(Grant No.2023NSFSC1919)。
文摘Independent cascade(IC)models,by simulating how one node can activate another,are important tools for studying the dynamics of information spreading in complex networks.However,traditional algorithms for the IC model implementation face significant efficiency bottlenecks when dealing with large-scale networks and multi-round simulations.To settle this problem,this study introduces a GPU-based parallel independent cascade(GPIC)algorithm,featuring an optimized representation of the network data structure and parallel task scheduling strategies.Specifically,for this GPIC algorithm,we propose a network data structure tailored for GPU processing,thereby enhancing the computational efficiency and the scalability of the IC model.In addition,we design a parallel framework that utilizes the full potential of GPU's parallel processing capabilities,thereby augmenting the computational efficiency.The results from our simulation experiments demonstrate that GPIC not only preserves accuracy but also significantly boosts efficiency,achieving a speedup factor of 129 when compared to the baseline IC method.Our experiments also reveal that when using GPIC for the independent cascade simulation,100-200 simulation rounds are sufficient for higher-cost studies,while high precision studies benefit from 500 rounds to ensure reliable results,providing empirical guidance for applying this new algorithm to practical research.
基金Supported by the National Natural Science Foundation of China(Grant No.12031002)。
文摘Accurately identifying key nodes is essential for evaluating network robustness and controlling information propagation in complex network analysis. However, current research methods face limitations in applicability and accuracy. To address these challenges, this study introduces the K-GCN model, which integrates neighborhood k-shell distribution analysis with Graph Convolutional Network(GCN) technology to enhance key node identification in complex networks. The K-GCN model first leverages neighborhood k-shell distributions to calculate entropy values for each node, effectively quantifying node importance within the network. These entropy values are then used as key features within the GCN, which subsequently formulates intelligent strategies to maximize network connectivity disruption by removing a minimal set of nodes, thereby impacting the overall network architecture. Through iterative interactions with the environment, the GCN continuously refines its strategies, achieving precise identification of key nodes in the network. Unlike traditional methods, the K-GCN model not only captures local node features but also integrates the network structure and complex interrelations between neighboring nodes, significantly improving the accuracy and efficiency of key node identification.Experimental validation in multiple real-world network scenarios demonstrates that the K-GCN model outperforms existing methods.
基金Project supported the Natural Science Foundation of Zhejiang Province, China (Grant No. LQN25F030011)the Fundamental Research Project of Hangzhou Dianzi University (Grant No. KYS065624391)+1 种基金the National Natural Science Foundation of China (Grant No. 61573148)the Science and Technology Planning Project of Guangdong Province, China (Grant No. 2019A050520001)。
文摘This paper investigates a new SEIQR(susceptible–exposed–infected–quarantined–recovered) epidemic model with quarantine mechanism on heterogeneous complex networks. Firstly, the nonlinear SEIQR epidemic spreading dynamic differential coupling model is proposed. Then, by using mean-field theory and the next-generation matrix method, the equilibriums and basic reproduction number are derived. Theoretical results indicate that the basic reproduction number significantly relies on model parameters and topology of the underlying networks. In addition, the globally asymptotic stability of equilibrium and the permanence of the disease are proved in detail by the Routh–Hurwitz criterion, Lyapunov method and La Salle's invariance principle. Furthermore, we find that the quarantine mechanism, that is the quarantine rate(γ1, γ2), has a significant effect on epidemic spreading through sensitivity analysis of basic reproduction number and model parameters. Meanwhile, the optimal control model of quarantined rate and analysis method are proposed, which can optimize the government control strategies and reduce the number of infected individual. Finally, numerical simulations are given to verify the correctness of theoretical results and a practice application is proposed to predict and control the spreading of COVID-19.
基金Project supported by Jilin Provincial Science and Technology Development Plan(Grant No.20220101137JC).
文摘This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid synchronization of heterogeneous duplex complex networks.Therefore,we study the finite time hybrid synchronization of heterogeneous duplex networks,which employs the time-varying intermittent control to drive the duplex heterogeneous complex networks to achieve hybrid synchronization in finite time.To be specific,the switch frequency of the controllers can be changed with time by devise Lyapunov function and boundary function,the internal synchronization and external synchronization are achieved simultaneously in finite time.Finally,numerical examples are presented to illustrate the validness of theoretical results.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.62103375,62006106,61877055,and 62171413)the Philosophy and Social Science Planning Project of Zhejinag Province,China(Grant No.22NDJC009Z)+1 种基金the Education Ministry Humanities and Social Science Foundation of China(Grant No.19YJCZH056)the Natural Science Foundation of Zhejiang Province,China(Grant Nos.LY23F030003,LY22F030006,and LQ21F020005).
文摘The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments.Although there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved.In this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times.The proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread duration.The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming.Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency.Furthermore,we find that our method maintains robustness irrespective of the number of sources and the average degree of network.Compared with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.
基金Project supported by the Ministry of Education of China in the later stage of philosophy and social science research(Grant No.19JHG091)the National Natural Science Foundation of China(Grant No.72061003)+1 种基金the Major Program of National Social Science Fund of China(Grant No.20&ZD155)the Guizhou Provincial Science and Technology Projects(Grant No.[2020]4Y172)。
文摘We construct a dual-layer coupled complex network of communities and residents to represent the interconnected risk transmission network between communities and the disease transmission network among residents. It characterizes the process of infectious disease transmission among residents between communities through the SE2IHR model considering two types of infectors. By depicting a more fine-grained social structure and combining further simulation experiments, the study validates the crucial role of various prevention and control measures implemented by communities as primary executors in controlling the epidemic. Research shows that the geographical boundaries of communities and the social interaction patterns of residents have a significant impact on the spread of the epidemic, where early detection, isolation and treatment strategies at community level are essential for controlling the spread of the epidemic. In addition, the study explores the collaborative governance model and institutional advantages of communities and residents in epidemic prevention and control.
基金supported in part by the National Natural Science Foundation of China (62233012,62273087)the Research Fund for the Taishan Scholar Project of Shandong Province of Chinathe Shanghai Pujiang Program of China (22PJ1400400)。
文摘The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered mechanism(DETM).In order to optimize communication resource utilization,the DETM is employed to determine whether the current measurement data should be transmitted to the estimator or not.To guarantee a satisfactory estimation performance for the fault signal,an unknown-input-observer-based estimator is constructed to decouple the estimation error dynamics from the influence of fault signals.The aim of this paper is to find the suitable estimator parameters under the effects of DETM such that both the state estimates and fault estimates are confined within two sets of closed ellipsoid domains.The techniques of recursive matrix inequality are applied to derive sufficient conditions for the existence of the desired estimator,ensuring that the specified performance requirements are met under certain conditions.Then,the estimator gains are derived by minimizing the ellipsoid domain in the sense of trace and a recursive estimator parameter design algorithm is then provided.Finally,a numerical example is conducted to demonstrate the effectiveness of the designed estimator.
基金the National Natural Science Foundation of China(Nos.11361033 and 11861045)。
文摘One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms focus on single feature or manually extract the attributes,which occasionally results in the failure to fully capture the vertex’s importance.A new vertex centrality approach based on symmetric nonnegative matrix factorization(SNMF),called VCSNMF,is proposed in this paper.For highlight the characteristics of a network,the adjacency matrix and the degree matrix are fused to represent original data of the network via a weighted linear combination.First,SNMF automatically extracts the latent characteristics of vertices by factorizing the established original data matrix.Then we prove that each vertex’s composite feature which is constructed with one-dimensional factor matrix can be approximated as the term of eigenvector associated with the spectral radius of the network,otherwise obtained by the factor matrix on the hyperspace.Finally,VCSNMF integrates the composite feature and the topological structure to evaluate the performance of vertices.To verify the effectiveness of the VCSNMF criterion,eight existing centrality approaches are used as comparison measures to rank influential vertices in ten real-world networks.The experimental results assert the superiority of the method.
基金National Key Research and Development Program of China(No.2022YFC3803000).
文摘According to news reports on severe earthquakes since 2008,a total of 51 cases with magnitudes of 6.0 or above were analyzed,and 14 frequently occurring secondary disasters were identified.A disaster chain model was developed using principles from complex network theory.The vulnerability and risk level of each edge in this model were calculated,and high-risk edges and disaster chains were identified.The analysis reveals that the edge“floods→building collapses”has the highest vulnerability.Implementing measures to mitigate this edge is crucial for delaying the spread of secondary disasters.The highest risk is associated with the edge“building collapses→casualties,”and increased risks are also identified for chains such as“earthquake→building collapses→casualties,”“earthquake→landslides and debris flows→dammed lakes,”and“dammed lakes→floods→building collapses.”Following an earthquake,the prompt implementation of measures is crucial to effectively disrupt these chains and minimize the damage from secondary disasters.
基金The National Basic Research Program of China (973Program) (No.2005CB321802)Program for New Century Excellent Talents in University (No.NCET-06-0926)the National Natural Science Foundation of China (No.60873097,90612009)
文摘To resolve the ontology understanding problem, the structural features and the potential important terms of a large-scale ontology are investigated from the perspective of complex networks analysis. Through the empirical studies of the gene ontology with various perspectives, this paper shows that the whole gene ontology displays the same topological features as complex networks including ＂small world＂ and ＂scale-free＂,while some sub-ontologies have the ＂scale-free＂ property but no ＂small world＂ effect.The potential important terms in an ontology are discovered by some famous complex network centralization methods.An evaluation method based on information retrieval in MEDLINE is designed to measure the effectiveness of the discovered important terms.According to the relevant literature of the gene ontology terms,the suitability of these centralization methods for ontology important concepts discovering is quantitatively evaluated.The experimental results indicate that the betweenness centrality is the most appropriate method among all the evaluated centralization measures.
基金supported by the National Natural Science Foundation of China(61174022)the National High Technology Research and Development Program of China(863 Program)(2013AA013801)+2 种基金the Open Funding Project of State Key Laboratory of Virtual Reality Technology and Systems,Beihang University(BUAA-VR-14KF-02)the General Research Program of the Science Supported by Sichuan Provincial Department of Education(14ZB0322)the Fundamental Research Funds for the Central Universities(XDJK2014D008)
文摘Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centra- lity and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.
文摘A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.
基金Project supported by the National Natural Foundation of China(Grant No.11871328)the Shanghai Science and Technology Development Funds Soft Science Research Project(Grant No.21692109800).
文摘Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accelerating information diffusion.The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity.Moreover,they do not take into account the impact of network topology evolution over time,resulting in limitations in some applications.Based on local information of networks,a local clustering H-index(LCH)centrality measure is proposed,which considers neighborhood topology,the quantity and quality of neighbor nodes simultaneously.The proposed measure only needs the information of first-order and second-order neighbor nodes of networks,thus it has nearly linear time complexity and can be applicable to large-scale networks.In order to test the proposed measure,we adopt the susceptible-infected-recovered(SIR)and susceptible-infected(SI)models to simulate the spreading process.A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.
基金supported by National Natural Science Foundation of China(No.61273008)Science Research Project of Liaoning Provicial Education Department(No.L2012208)Science Foundation of Ministry of Housing and Urban-Rural Development(No.2013-K5-2)
文摘The problem of exponential synchronization for a class of general complex dynamical networks with nonlinear coupling delays by adaptive pinning periodically intermittent control is considered in this paper. We use the methods of the adaptive control, pinning control and periodically intermittent control. Based on the piecewise Lyapunov stability theory, some less conservative criteria are derived for the global exponential synchronization of the complex dynamical networks with coupling delays. And several corresponding adaptive pinning feedback synchronization controllers are designed. These controllers have strong robustness against the coupling strength and topological structure of the network. Using the delayed nonlinear system as the nodes of the networks, a numerical example of the complex dynamical networks with nonlinear coupling delays is given to demonstrate the effectiveness of the control strategy.
基金Project supported by the National Natural Science Foundation of China (Grant No.60774088)the Program for New Century Excellent Talents of Higher Education of China (Grant No NCET 2005-290)the Special Research Fund for the Doctoral Program of Higher Education of China (Grant No 20050055013)
文摘In this paper, a dynamic epidemic control model on the uncorrelated complex networks is proposed. By means of theoretical analysis, we found that the new model has a similar epidemic threshold as that of the susceptible-infectedrecovered （SIR） model on the above networks, but it can reduce the prevalence of the infected individuals remarkably. This result may help us understand epidemic spreading phenomena on real networks and design appropriate strategies to control infections.
基金Project supported by the National Natural Science Foundation of China (Grant No. 10901145)the Natural Science Foundation of Shanxi Province,China(Grant Nos. 2009011005-1 and 2012011002-1)the Top Young Academic Leaders of Higher Learning Institutions of Shanxi Province,China
文摘In this paper,a sexually transmitted disease model is proposed on complex networks,where contacts between humans are treated as a scale-free social network.There are three groups in our model,which are dangerous male,non-dangerous male,and female.By mathematical analysis,we obtain the basic reproduction number for the existence of endemic equilibrium and study the effects of various immunization schemes about different groups.Furthermore,numerical simulations are undertaken to verify more conclusions.
文摘Identifying influential nodes in complex networks is essential for network robust and stability,such as viral marketing and information control.Various methods have been proposed to define the influence of nodes.In this paper,we comprehensively consider the global position and local structure to identify influential nodes.The number of iterations in the process of k-shell decomposition is taken into consideration,and the improved k-shell decomposition is then put forward.The improved k-shell decomposition and degree of target node are taken as the benchmark centrality,in addition,as is well known,the effect between node pairs is inversely proportional to the shortest path length between two nodes,and then we also consider the effect of neighbors on target node.To evaluate the performance of the proposed method,susceptible-infected(SI)model is adopted to simulate the spreading process in four real networks,and the experimental results show that the proposed method has obvious advantages over classical centrality measures in identifying influential nodes.
基金The project supported by National Natural Science Foundation of China under Grant Nos. 70271067 and 70401020 and the Science Foundation of the Ministry of Education of China under Grant No. 03113
文摘We analyze the correlation properties of the Erd6s-Rdnyi random graph （RG） and the Barabdsi-Albert scale-free network （SF） under the attack and repair strategy with detrended fluctuation analysis （DFA）. The maximum degree kmax, representing the local property of the system, shows similar scaling behaviors for random graphs and scale-free networks. The fluctuations are quite random at short time scales but display strong anticorrelation at longer time scales under the same system size N and different repair probability pre. The average degree 〈k〉, revealing the statistical property of the system, exhibits completely different scaling behaviors for random graphs and scale-free networks. Random graphs display long-range power-law correlations. Scale-free networks are uncorrelated at short time scales; while anticorrelated at longer time scales and the anticorrelation becoming stronger with the increase of pre.
