Complex networks play a crucial role in the study of collective behavior,encompassing the analysis of dynamical properties and network topology.In real-world systems,higher-order interactions among multiple entities a...Complex networks play a crucial role in the study of collective behavior,encompassing the analysis of dynamical properties and network topology.In real-world systems,higher-order interactions among multiple entities are widespread and significantly influence collective dynamics.Here,we extend the synchronization alignment function framework to hypergraphs of arbitrary order by leveraging the multi-order Laplacian matrix to encode higher-order interactions.Our findings reveal that the upper bound of synchronous behavior is determined by the maximum eigenvalue of the multi-order Laplacian matrix.Furthermore,we decompose the contribution of each hyperedge to this eigenvalue and utilize it as a basis for designing an eigenvalue-based topology modification algorithm.This algorithm effectively enhances the upper bound of synchronous behavior without altering the total number of higher-order interactions.Our study provides new insights into dynamical optimization and topology tuning in hypergraphs,advancing the understanding of the interplay between higher-order interactions and collective dynamics.展开更多
Based on the framework of BSP, a Hierarchical Bulk Synchronous Parallel (HBSP) performance model is introduced in this paper to capture the per formance optimization problem for various stages in parallel program deve...Based on the framework of BSP, a Hierarchical Bulk Synchronous Parallel (HBSP) performance model is introduced in this paper to capture the per formance optimization problem for various stages in parallel program development and to accurately predict the performance of a parallel program by considering fac tors causing variance at local computation and global communication. The related methodology has been applied to several real applications and the results show that HBSP is a suitable model for optimizing parallel programs.展开更多
This paper presents a novel optimal synchronization control method for multi-agent systems with input saturation.The multi-agent game theory is introduced to transform the optimal synchronization control problem into ...This paper presents a novel optimal synchronization control method for multi-agent systems with input saturation.The multi-agent game theory is introduced to transform the optimal synchronization control problem into a multi-agent nonzero-sum game.Then,the Nash equilibrium can be achieved by solving the coupled Hamilton–Jacobi–Bellman(HJB)equations with nonquadratic input energy terms.A novel off-policy reinforcement learning method is presented to obtain the Nash equilibrium solution without the system models,and the critic neural networks(NNs)and actor NNs are introduced to implement the presented method.Theoretical analysis is provided,which shows that the iterative control laws converge to the Nash equilibrium.Simulation results show the good performance of the presented method.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12247153,T2293771,and 12247101)the Zhejiang Provincial Natural Science Foundation of China(Grant No.LTGY24A050002)+3 种基金the Sichuan Science and Technology Program(Grant Nos.2024NSFSC1364 and 2023NSFSC1919)the Project of Huzhou Science and Technology Bureau(Grant No.2022YZ29)the UESTCYDRI research start-up(Grant No.U03210066)the New Cornerstone Science Foundation through the Xplorer Prize。
文摘Complex networks play a crucial role in the study of collective behavior,encompassing the analysis of dynamical properties and network topology.In real-world systems,higher-order interactions among multiple entities are widespread and significantly influence collective dynamics.Here,we extend the synchronization alignment function framework to hypergraphs of arbitrary order by leveraging the multi-order Laplacian matrix to encode higher-order interactions.Our findings reveal that the upper bound of synchronous behavior is determined by the maximum eigenvalue of the multi-order Laplacian matrix.Furthermore,we decompose the contribution of each hyperedge to this eigenvalue and utilize it as a basis for designing an eigenvalue-based topology modification algorithm.This algorithm effectively enhances the upper bound of synchronous behavior without altering the total number of higher-order interactions.Our study provides new insights into dynamical optimization and topology tuning in hypergraphs,advancing the understanding of the interplay between higher-order interactions and collective dynamics.
文摘Based on the framework of BSP, a Hierarchical Bulk Synchronous Parallel (HBSP) performance model is introduced in this paper to capture the per formance optimization problem for various stages in parallel program development and to accurately predict the performance of a parallel program by considering fac tors causing variance at local computation and global communication. The related methodology has been applied to several real applications and the results show that HBSP is a suitable model for optimizing parallel programs.
基金Project supported by the National Key R&D Program of China(No.2018YFB1702300)the National Natural Science Foundation of China(Nos.61722312 and 61533017)。
文摘This paper presents a novel optimal synchronization control method for multi-agent systems with input saturation.The multi-agent game theory is introduced to transform the optimal synchronization control problem into a multi-agent nonzero-sum game.Then,the Nash equilibrium can be achieved by solving the coupled Hamilton–Jacobi–Bellman(HJB)equations with nonquadratic input energy terms.A novel off-policy reinforcement learning method is presented to obtain the Nash equilibrium solution without the system models,and the critic neural networks(NNs)and actor NNs are introduced to implement the presented method.Theoretical analysis is provided,which shows that the iterative control laws converge to the Nash equilibrium.Simulation results show the good performance of the presented method.
