Algebraic criteria for consensus problems of signed directed networks

  • Mingjun Du
  • , Baoli Ma*
  • , Wenjing Xie
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes some algebraic criteria for consensus problems and structure of signed networks whose interactions among agents are denoted by singed digraphs. Firstly, we develop a new method to obtain the left eigenvector of the Laplacian matrix associated with zero eigenvalue. With the left eigenvector, auxiliary vector is constructed and correlated with the connectivity of signed digraph. Finally, sufficient and necessary algebraic criteria for consensus problems and structure of signed graphs are provided based on auxiliary vector. Numerical instances are presented to verify the theoretical results.

Original languageEnglish
Title of host publicationProceedings of 2017 Chinese Intelligent Systems Conference
EditorsJunping Du, Weicun Zhang, Yingmin Jia
PublisherSpringer Verlag
Pages451-460
Number of pages10
ISBN (Print)9789811064951
DOIs
StatePublished - 2018
EventChinese Intelligent Systems Conference, CISC 2017 - Mudanjiang, China
Duration: 14 Oct 201715 Oct 2017

Publication series

NameLecture Notes in Electrical Engineering
Volume459
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

ConferenceChinese Intelligent Systems Conference, CISC 2017
Country/TerritoryChina
CityMudanjiang
Period14/10/1715/10/17

Keywords

  • Algebraic criteria
  • Auxiliary vector
  • Consensus problems
  • Left eigenvector
  • Signed digraph

Fingerprint

Dive into the research topics of 'Algebraic criteria for consensus problems of signed directed networks'. Together they form a unique fingerprint.

Cite this