咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Dynamics over signed networks 收藏
arXiv

Dynamics over signed networks

作     者:Shi, Guodong Altafini, Claudio Baras, John S. 

作者机构:Australian Center for Field Robotics School of Aerospace Mechanical and Mechatronic Engineering University of Sydney NSW Australia Division of Automatic Control Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden Institute for Systems Research Department of Electrical and Computer Engineering University of Maryland College ParkMD20742 United States 

出 版 物:《arXiv》 (arXiv)

年 卷 期:2017年

核心收录:

主  题:Algebra 

摘      要:A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two different types of interactions take place along the positive and negative links, respectively, arise from various biological, social, political, and economic systems. As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature. This paper reviews a few fundamental convergence results for such dynamics over deterministic or random signed networks under a unified algebraic-graphical method. We show that a systematic tool of studying node state evolution over signed networks can be obtained utilizing generalized Perron-Frobenius theory, graph theory, and elementary algebraic recursions. Copyright © 2017, The Authors. All rights reserved.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分