A modified Olami-Feder-Christenaen model of self-organized criticality on generalized Barabási-Albert (GBA) scale-flee networks is investigated. We find that our mode/ displays power-law behavior and the avalan...A modified Olami-Feder-Christenaen model of self-organized criticality on generalized Barabási-Albert (GBA) scale-flee networks is investigated. We find that our mode/ displays power-law behavior and the avalanche dynamical behavior is sensitive to the topological structure of networks. Furthermore, the exponent ~ of the model depends on b, which weights the distance in comparison with the degree in the GBA network evolution.展开更多
A modified evolution model of self-organized criticality on generalized Barabasi-Albert (GBA).scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behavi...A modified evolution model of self-organized criticality on generalized Barabasi-Albert (GBA).scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.展开更多
Some recent research reports that a dendritic neuron model(DNM)can achieve better performance than traditional artificial neuron networks(ANNs)on classification,prediction,and other problems when its parameters are we...Some recent research reports that a dendritic neuron model(DNM)can achieve better performance than traditional artificial neuron networks(ANNs)on classification,prediction,and other problems when its parameters are well-tuned by a learning algorithm.However,the back-propagation algorithm(BP),as a mostly used learning algorithm,intrinsically suffers from defects of slow convergence and easily dropping into local minima.Therefore,more and more research adopts non-BP learning algorithms to train ANNs.In this paper,a dynamic scale-free network-based differential evolution(DSNDE)is developed by considering the demands of convergent speed and the ability to jump out of local minima.The performance of a DSNDE trained DNM is tested on 14 benchmark datasets and a photovoltaic power forecasting problem.Nine meta-heuristic algorithms are applied into comparison,including the champion of the 2017 IEEE Congress on Evolutionary Computation(CEC2017)benchmark competition effective butterfly optimizer with covariance matrix adapted retreat phase(EBOwithCMAR).The experimental results reveal that DSNDE achieves better performance than its peers.展开更多
A novel scale-flee network model based on clique (complete subgraph of random size) growth and preferential attachment was proposed. The simulations of this model were carried out. And the necessity of two evolving ...A novel scale-flee network model based on clique (complete subgraph of random size) growth and preferential attachment was proposed. The simulations of this model were carried out. And the necessity of two evolving mechanisms of the model was verified. According to the mean-field theory, the degree distribution of this model was analyzed and computed. The degree distribution function of vertices of the generating network P(d) is 2m^2m1^-3(d-m1 + 1)^-3, where m and m1 denote the number of the new adding edges and the vertex number of the cliques respectively, d is the degree of the vertex, while one of cliques P(k) is 2m^2Ek^-3, where k is the degree of the clique. The simulated and analytical results show that both the degree distributions of vertices and cliques follow the scale-flee power-law distribution. The scale-free property of this model disappears in the absence of any one of the evolving mechanisms. Moreover, the randomicity of this model increases with the increment of the vertex number of the cliques.展开更多
As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structur...As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structural integrity, functional integrity and dynamics of the networks. In order to overcome the shortcomings in the existing work on the robustness of complex networks, only nodes or edges are considered, while the defects of high-order structure in the network are ignored.From the perspective of network motif, we propose an entropy of node degree distribution based on motif to measure the robustness of scale-free networks under random attacks. The effectiveness and superiority of our method are verified and analyzed in the BA scale-free networks.展开更多
A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays ...A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays powerlaw behavior of avalanche sizes and generates long-range temporal correlation. More importantly, we find different dynamical behavior for nodes with different connectivity in the scale-free networks.展开更多
Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Un...Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue(HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue(HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.展开更多
In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturban...In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents' states to an expected consensus track. Then, the influence of the disturbances is considered by developing disturbance observers, and disturbance observers based control (DOBC) are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the low degree node pinned.展开更多
In order to simulate the real growing process, a new type of knowledge network growth mechanism based on local world connectivity is constructed. By the mean-field method, theoretical prediction of the degree distribu...In order to simulate the real growing process, a new type of knowledge network growth mechanism based on local world connectivity is constructed. By the mean-field method, theoretical prediction of the degree distribution of the knowledge network is given, which is verified by Matlab simulations. When the new added node's local world size is very small, the degree distribution of the knowledge network approximately has the property of scale-free. When the new added node's local world size is not very small, the degree distribution transforms from pure power-law to the power-law with an exponential tailing. And the scale-free index increases as the number of new added edges decreases and the tunable parameters increase. Finally, comparisons of some knowledge indices in knowledge networks generated by the local world mechanism and the global mechanism are given. In the long run, compared with the global mechanism, the local world mechanism leads the average knowledge levels to slower growth and brings homogenous phenomena.展开更多
基金The project supported by National Natural Science Foundation of China under Grant No. 90203008 and the Doctoral Foundation of the Ministry of Education of China
文摘A modified Olami-Feder-Christenaen model of self-organized criticality on generalized Barabási-Albert (GBA) scale-flee networks is investigated. We find that our mode/ displays power-law behavior and the avalanche dynamical behavior is sensitive to the topological structure of networks. Furthermore, the exponent ~ of the model depends on b, which weights the distance in comparison with the degree in the GBA network evolution.
基金The project supported by National Natural Science Foundation of China under Grant No. 90203008 and the Doctoral Foundation of Ministry of Education of China
文摘A modified evolution model of self-organized criticality on generalized Barabasi-Albert (GBA).scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.
基金This work was partially supported by the National Natural Science Foundation of China(62073173,61833011)the Natural Science Foundation of Jiangsu Province,China(BK20191376)the Nanjing University of Posts and Telecommunications(NY220193,NY220145)。
文摘Some recent research reports that a dendritic neuron model(DNM)can achieve better performance than traditional artificial neuron networks(ANNs)on classification,prediction,and other problems when its parameters are well-tuned by a learning algorithm.However,the back-propagation algorithm(BP),as a mostly used learning algorithm,intrinsically suffers from defects of slow convergence and easily dropping into local minima.Therefore,more and more research adopts non-BP learning algorithms to train ANNs.In this paper,a dynamic scale-free network-based differential evolution(DSNDE)is developed by considering the demands of convergent speed and the ability to jump out of local minima.The performance of a DSNDE trained DNM is tested on 14 benchmark datasets and a photovoltaic power forecasting problem.Nine meta-heuristic algorithms are applied into comparison,including the champion of the 2017 IEEE Congress on Evolutionary Computation(CEC2017)benchmark competition effective butterfly optimizer with covariance matrix adapted retreat phase(EBOwithCMAR).The experimental results reveal that DSNDE achieves better performance than its peers.
基金Projects(60504027,60573123) supported by the National Natural Science Foundation of ChinaProject(20060401037) supported by the National Postdoctor Science Foundation of ChinaProject(X106866) supported by the Natural Science Foundation of Zhejiang Province,China
文摘A novel scale-flee network model based on clique (complete subgraph of random size) growth and preferential attachment was proposed. The simulations of this model were carried out. And the necessity of two evolving mechanisms of the model was verified. According to the mean-field theory, the degree distribution of this model was analyzed and computed. The degree distribution function of vertices of the generating network P(d) is 2m^2m1^-3(d-m1 + 1)^-3, where m and m1 denote the number of the new adding edges and the vertex number of the cliques respectively, d is the degree of the vertex, while one of cliques P(k) is 2m^2Ek^-3, where k is the degree of the clique. The simulated and analytical results show that both the degree distributions of vertices and cliques follow the scale-flee power-law distribution. The scale-free property of this model disappears in the absence of any one of the evolving mechanisms. Moreover, the randomicity of this model increases with the increment of the vertex number of the cliques.
基金Project supported by the National Natural Science Foundation of China (Grant No. 62006169)the Youth Natural Science Foundation of Shanxi Province, China (Grant No. 201901D211304)+1 种基金the China Postdoctoral Science Foundation (Grant No. 2021M692400)the Science and Technology Innovation Projects of Universities in Shanxi Province, China (Grant No. 2020L0021)。
文摘As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structural integrity, functional integrity and dynamics of the networks. In order to overcome the shortcomings in the existing work on the robustness of complex networks, only nodes or edges are considered, while the defects of high-order structure in the network are ignored.From the perspective of network motif, we propose an entropy of node degree distribution based on motif to measure the robustness of scale-free networks under random attacks. The effectiveness and superiority of our method are verified and analyzed in the BA scale-free networks.
基金The project supported by National Natural Science Foundation of China under Grant No. 90203008 and the Doctoral Foundation of the Ministry of Education of China.
文摘A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays powerlaw behavior of avalanche sizes and generates long-range temporal correlation. More importantly, we find different dynamical behavior for nodes with different connectivity in the scale-free networks.
基金Project supported by the Youth Science Funds of Shandong Academy of Sciences,China(Grant No.2014QN032)
文摘Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue(HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue(HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.
基金Supported by the National Natural Science Foundation of China under Grant Nos.60774016,60875039,60904022the Science Foundation of Education Office of Shandong Province of China under Grant No.J08LJ01Internal Visiting Scholar Object for Excellence Youth Teacher of the College of Shandong Province of China
文摘In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents' states to an expected consensus track. Then, the influence of the disturbances is considered by developing disturbance observers, and disturbance observers based control (DOBC) are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the low degree node pinned.
基金The National Natural Science Foundation of China(No70571013,70973017)Program for New Century Excellent Talentsin University (NoNCET-06-0471)Human Social Science Fund Project ofMinistry of Education (No09YJA630020)
文摘In order to simulate the real growing process, a new type of knowledge network growth mechanism based on local world connectivity is constructed. By the mean-field method, theoretical prediction of the degree distribution of the knowledge network is given, which is verified by Matlab simulations. When the new added node's local world size is very small, the degree distribution of the knowledge network approximately has the property of scale-free. When the new added node's local world size is not very small, the degree distribution transforms from pure power-law to the power-law with an exponential tailing. And the scale-free index increases as the number of new added edges decreases and the tunable parameters increase. Finally, comparisons of some knowledge indices in knowledge networks generated by the local world mechanism and the global mechanism are given. In the long run, compared with the global mechanism, the local world mechanism leads the average knowledge levels to slower growth and brings homogenous phenomena.