Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weight...Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weighted scale-free community network and susceptible-infected-recovered(SIR)model.To solve the problem of difficulty in describing the changes in the structure and collaboration mode of the system under external factors,a two-dimensional Monte Carlo method and an improved dynamic Bayesian network are used to simulate the impact of external environmental factors on multi-agent systems.A collaborative information flow path optimization algorithm for agents under environmental factors is designed based on the Dijkstra algorithm.A method for evaluating system interoperability is designed based on simulation experiments,providing reference for the construction planning and optimization of organizational application of the system.Finally,the feasibility of the method is verified through case studies.展开更多
The control of highly contagious disease spreading in campuses is a critical challenge.In residential universities,students attend classes according to a curriculum schedule,and mainly pack into classrooms,dining hall...The control of highly contagious disease spreading in campuses is a critical challenge.In residential universities,students attend classes according to a curriculum schedule,and mainly pack into classrooms,dining halls and dorms.They move from one place to another.To simulate such environments,we propose an agent-based susceptible–infected–recovered model with time-varying heterogeneous contact networks.In close environments,maintaining physical distancing is the most widely recommended and encouraged non-pharmaceutical intervention.It can be easily realized by using larger classrooms,adopting staggered dining hours,decreasing the number of students per dorm and so on.Their real-world influence remains uncertain.With numerical simulations,we obtain epidemic thresholds.The effect of such countermeasures on reducing the number of disease cases is also quantitatively evaluated.展开更多
In this paper, we studied the traveling wave solutions of a SIR epidemic model with spatial-temporal delay. We proved that this result is determined by the basic reproduction number R0and the minimum wave speed c*of t...In this paper, we studied the traveling wave solutions of a SIR epidemic model with spatial-temporal delay. We proved that this result is determined by the basic reproduction number R0and the minimum wave speed c*of the corresponding ordinary differential equations. The methods used in this paper are primarily the Schauder fixed point theorem and comparison principle. We have proved that when R0>1and c>c*, the model has a non-negative and non-trivial traveling wave solution. However, for R01and c≥0or R0>1and 0cc*, the model does not have a traveling wave solution.展开更多
In this paper, we study the epidemic spreading in scale-flee networks and propose a new susceptible-infected- recovered （SIR） model that includes the effect of individual vigilance. In our model, the effective sprea...In this paper, we study the epidemic spreading in scale-flee networks and propose a new susceptible-infected- recovered （SIR） model that includes the effect of individual vigilance. In our model, the effective spreading rate is dynamically adjusted with the time evolution at the vigilance period. Using the mean-field theory, an analytical result is derived. It shows that individual vigilance has no effect on the epidemic threshold. The numerical simulations agree well with the analytical result. Purthermore, we investigate the effect of individual vigilance on the epidemic spreading speed. It is shown that individual vigilance can slow the epidemic spreading speed effectively and delay the arrival of peak epidemic infection.展开更多
Finding the important nodes in complex networks by topological structure is of great significance to network invulnerability.Several centrality measures have been proposed recently to evaluate the performance of nodes...Finding the important nodes in complex networks by topological structure is of great significance to network invulnerability.Several centrality measures have been proposed recently to evaluate the performance of nodes based on their correlation,showing that the interaction between nodes has an influence on the importance of nodes.In this paper,a novel method based on node’s distribution and global influence in complex networks is proposed.The nodes in the complex networks are classified according to the distance matrix,then the correlation coefficient between pairs of nodes is calculated.From the whole perspective in the network,the global similarity centrality(GSC)is proposed based on the relevance and the shortest distance between any two nodes.The efficiency,accuracy,and monotonicity of the proposed method are analyzed in two artificial datasets and eight real datasets of different sizes.Experimental results show that the performance of GSC method outperforms those current state-of-the-art algorithms.展开更多
Hypergraphs,which encapsulate interactions of higher-order beyond mere pairwise connections,are essential for representing polyadic relationships within complex systems.Consequently,an increasing number of researchers...Hypergraphs,which encapsulate interactions of higher-order beyond mere pairwise connections,are essential for representing polyadic relationships within complex systems.Consequently,an increasing number of researchers are focusing on the centrality problem in hypergraphs.Specifically,researchers are tackling the challenge of utilizing higher-order structures to effectively define centrality metrics.This paper presents a novel approach,LGK,derived from the K-shell decomposition method,which incorporates both global and local perspectives.Empirical evaluations indicate that the LGK method provides several advantages,including reduced time complexity and improved accuracy in identifying critical nodes in hypergraphs.展开更多
基金supported by the Key R&D Projects in Jiangsu Province(BE2021729)the Key Primary Research Project of Primary Strengthening Program(KYZYJKKCJC23001).
文摘Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weighted scale-free community network and susceptible-infected-recovered(SIR)model.To solve the problem of difficulty in describing the changes in the structure and collaboration mode of the system under external factors,a two-dimensional Monte Carlo method and an improved dynamic Bayesian network are used to simulate the impact of external environmental factors on multi-agent systems.A collaborative information flow path optimization algorithm for agents under environmental factors is designed based on the Dijkstra algorithm.A method for evaluating system interoperability is designed based on simulation experiments,providing reference for the construction planning and optimization of organizational application of the system.Finally,the feasibility of the method is verified through case studies.
基金Project supported by the National Natural Science Foundation of China(Grant No.61871234).
文摘The control of highly contagious disease spreading in campuses is a critical challenge.In residential universities,students attend classes according to a curriculum schedule,and mainly pack into classrooms,dining halls and dorms.They move from one place to another.To simulate such environments,we propose an agent-based susceptible–infected–recovered model with time-varying heterogeneous contact networks.In close environments,maintaining physical distancing is the most widely recommended and encouraged non-pharmaceutical intervention.It can be easily realized by using larger classrooms,adopting staggered dining hours,decreasing the number of students per dorm and so on.Their real-world influence remains uncertain.With numerical simulations,we obtain epidemic thresholds.The effect of such countermeasures on reducing the number of disease cases is also quantitatively evaluated.
文摘In this paper, we studied the traveling wave solutions of a SIR epidemic model with spatial-temporal delay. We proved that this result is determined by the basic reproduction number R0and the minimum wave speed c*of the corresponding ordinary differential equations. The methods used in this paper are primarily the Schauder fixed point theorem and comparison principle. We have proved that when R0>1and c>c*, the model has a non-negative and non-trivial traveling wave solution. However, for R01and c≥0or R0>1and 0cc*, the model does not have a traveling wave solution.
基金Project supported by the National Natural Science Foundation of China(Grant No.60874091)the Six Projects Sponsoring Talent Summits of Jiangsu Province,China(Grant No.SJ209006)+1 种基金the Natural Science Foundation of Jiangsu Province,China(Grant No.BK2010526)the Graduate Student Innovation Research Project of Jiangsu Province,China(Grant No.CXLX110417)
文摘In this paper, we study the epidemic spreading in scale-flee networks and propose a new susceptible-infected- recovered （SIR） model that includes the effect of individual vigilance. In our model, the effective spreading rate is dynamically adjusted with the time evolution at the vigilance period. Using the mean-field theory, an analytical result is derived. It shows that individual vigilance has no effect on the epidemic threshold. The numerical simulations agree well with the analytical result. Purthermore, we investigate the effect of individual vigilance on the epidemic spreading speed. It is shown that individual vigilance can slow the epidemic spreading speed effectively and delay the arrival of peak epidemic infection.
基金the National Natural Science Foundation of China(Nos.11361033,62162040 and 11861045)。
文摘Finding the important nodes in complex networks by topological structure is of great significance to network invulnerability.Several centrality measures have been proposed recently to evaluate the performance of nodes based on their correlation,showing that the interaction between nodes has an influence on the importance of nodes.In this paper,a novel method based on node’s distribution and global influence in complex networks is proposed.The nodes in the complex networks are classified according to the distance matrix,then the correlation coefficient between pairs of nodes is calculated.From the whole perspective in the network,the global similarity centrality(GSC)is proposed based on the relevance and the shortest distance between any two nodes.The efficiency,accuracy,and monotonicity of the proposed method are analyzed in two artificial datasets and eight real datasets of different sizes.Experimental results show that the performance of GSC method outperforms those current state-of-the-art algorithms.
文摘Hypergraphs,which encapsulate interactions of higher-order beyond mere pairwise connections,are essential for representing polyadic relationships within complex systems.Consequently,an increasing number of researchers are focusing on the centrality problem in hypergraphs.Specifically,researchers are tackling the challenge of utilizing higher-order structures to effectively define centrality metrics.This paper presents a novel approach,LGK,derived from the K-shell decomposition method,which incorporates both global and local perspectives.Empirical evaluations indicate that the LGK method provides several advantages,including reduced time complexity and improved accuracy in identifying critical nodes in hypergraphs.
