.png){kind=icon}
返回
Synchronization and Consensus in State-Dependent Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2013.2278351.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study synchronization and consensus phenomena in state-dependent graphs in which the edges are weighted according to the Hebbian learning rule or its modified version. By exploring the master stability function of the synchronous state, we show that the modified Hebbian function as coupling strength enlarges the stability region of the synchronous state. In terms of consensus, given that the state-dependent weights are always positive, we prove that consensus in a network of multi-agent systems is always reachable. Furthermore, we show that in state-dependent graphs the second smallest eigenvalue of the graph Laplacian matrix has larger values due to the state-dependency, resulting in speed up of the convergence process.
Keyword:
Adaptive coupling
consensus
Hebbian learning rule
master-stability function
state-dependent graphs
synchronization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.8K
被引数:
2.2W
机构
引用论文
分享收藏Novel decentralized adaptive strategies for the synchronization of complex networks.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
查看更多内容