Almost decouplability of any directed weighted network topology

Ning Cai, Jun-Wei Cao and M. Junaid Khan

Physica A: Statistical Mechanics and its Applications, 2015, vol. 436, issue C, 637-645

Abstract: This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form composed of uncoupled vertices, and thus reduce the complexity of analysis for networked dynamical systems. As an example of its application, the consensus problem of linear multi-agent systems with time-varying network topologies is addressed. As a result, a necessary and sufficient condition for uniform consensus is proposed.

Keywords: Network; Consensus; Multi-agent systems (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437115004197
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:436:y:2015:i:c:p:637-645

DOI: 10.1016/j.physa.2015.05.004

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().