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 employi...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.展开更多
Due to the increasingly large size and changing nature of social networks, algorithms for dynamic networks have become an important part of modern day community detection. In this paper, we use a well-known static com...Due to the increasingly large size and changing nature of social networks, algorithms for dynamic networks have become an important part of modern day community detection. In this paper, we use a well-known static community detection algorithm and modify it to discover communities in dynamic networks. We have developed a dynamic community detection algorithm based on Speaker-Listener Label Propagation Algorithm (SLPA) called SLPA Dynamic (SLPAD). This algorithm, tested on two real dynamic networks, cuts down on the time that it would take SLPA to run, as well as produces similar, and in some cases better, communities. We compared SLPAD to SLPA, LabelRankT, and another algorithm we developed, Dynamic Structural Clustering Algorithm for Networks Overlapping (DSCAN-O), to further test its validity and ability to detect overlapping communities when compared to other community detection algorithms. SLPAD proves to be faster than all of these algorithms, as well as produces communities with just as high modularity for each network.展开更多
分析了动态网络最短程求解的研究现状,研究了动态网络的结构与求解最短程之间的关系。定义了以速度建模的动态网络,证明其满足弱FIFO(First In First Out)条件;证明了满足弱FIFO的充分必要条件是网络的任一条边的通过函数均是非降函数,...分析了动态网络最短程求解的研究现状,研究了动态网络的结构与求解最短程之间的关系。定义了以速度建模的动态网络,证明其满足弱FIFO(First In First Out)条件;证明了满足弱FIFO的充分必要条件是网络的任一条边的通过函数均是非降函数,通过函数均是非降函数的网络等价于用速度定义的动态网络;证明了动态网络可直接利用Dijkstra算法求解最短程的充分条件;研究了怎样建立满足弱FIFO条件或等价条件的动态网络,给出了基于弱FIFO动态网络求解最短程的算法,并通过一个典型的例子说明上述方法的有效性.展开更多
基金supported by the National Natural Science Foundation of China (6057408860274014)
文摘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.
文摘Due to the increasingly large size and changing nature of social networks, algorithms for dynamic networks have become an important part of modern day community detection. In this paper, we use a well-known static community detection algorithm and modify it to discover communities in dynamic networks. We have developed a dynamic community detection algorithm based on Speaker-Listener Label Propagation Algorithm (SLPA) called SLPA Dynamic (SLPAD). This algorithm, tested on two real dynamic networks, cuts down on the time that it would take SLPA to run, as well as produces similar, and in some cases better, communities. We compared SLPAD to SLPA, LabelRankT, and another algorithm we developed, Dynamic Structural Clustering Algorithm for Networks Overlapping (DSCAN-O), to further test its validity and ability to detect overlapping communities when compared to other community detection algorithms. SLPAD proves to be faster than all of these algorithms, as well as produces communities with just as high modularity for each network.
文摘分析了动态网络最短程求解的研究现状,研究了动态网络的结构与求解最短程之间的关系。定义了以速度建模的动态网络,证明其满足弱FIFO(First In First Out)条件;证明了满足弱FIFO的充分必要条件是网络的任一条边的通过函数均是非降函数,通过函数均是非降函数的网络等价于用速度定义的动态网络;证明了动态网络可直接利用Dijkstra算法求解最短程的充分条件;研究了怎样建立满足弱FIFO条件或等价条件的动态网络,给出了基于弱FIFO动态网络求解最短程的算法,并通过一个典型的例子说明上述方法的有效性.
