Pulling the strings on agreement

Anchoring, controllability, and graph automorphisms

Amirreza Rahmani, Mehran Mesbahi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)

Abstract

This work examines the controlled Laplacian (or agreement) over a network of interconnected dynamic units. This dynamics has recently been the focus of a large number of research work in the systems community. Most of the existing work in this area- however- consider the unforced agreement protocol. In the present paper, we consider the controlled version of this dynamics and introduce graph theoretic conditions for its system theoretic properties. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, relates to the network controllability. Some of the ramifications of such a characterization are then explored.

Original languageEnglish
Title of host publicationProceedings of the American Control Conference
Pages2738-2743
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 American Control Conference, ACC - New York, NY, United States
Duration: Jul 9 2007Jul 13 2007

Other

Other2007 American Control Conference, ACC
CountryUnited States
CityNew York, NY
Period7/9/077/13/07

Fingerprint

Controllability

Keywords

  • Agreement dynamics
  • Algebraic graph theory
  • Automorphism group
  • Controllability

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Rahmani, A., & Mesbahi, M. (2007). Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms. In Proceedings of the American Control Conference (pp. 2738-2743). [4282502] https://doi.org/10.1109/ACC.2007.4282502

Pulling the strings on agreement : Anchoring, controllability, and graph automorphisms. / Rahmani, Amirreza; Mesbahi, Mehran.

Proceedings of the American Control Conference. 2007. p. 2738-2743 4282502.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahmani, A & Mesbahi, M 2007, Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms. in Proceedings of the American Control Conference., 4282502, pp. 2738-2743, 2007 American Control Conference, ACC, New York, NY, United States, 7/9/07. https://doi.org/10.1109/ACC.2007.4282502
Rahmani A, Mesbahi M. Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms. In Proceedings of the American Control Conference. 2007. p. 2738-2743. 4282502 https://doi.org/10.1109/ACC.2007.4282502
Rahmani, Amirreza ; Mesbahi, Mehran. / Pulling the strings on agreement : Anchoring, controllability, and graph automorphisms. Proceedings of the American Control Conference. 2007. pp. 2738-2743
@inproceedings{e1844b4b17ca410b883c91e05a55e80c,
title = "Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms",
abstract = "This work examines the controlled Laplacian (or agreement) over a network of interconnected dynamic units. This dynamics has recently been the focus of a large number of research work in the systems community. Most of the existing work in this area- however- consider the unforced agreement protocol. In the present paper, we consider the controlled version of this dynamics and introduce graph theoretic conditions for its system theoretic properties. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, relates to the network controllability. Some of the ramifications of such a characterization are then explored.",
keywords = "Agreement dynamics, Algebraic graph theory, Automorphism group, Controllability",
author = "Amirreza Rahmani and Mehran Mesbahi",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ACC.2007.4282502",
language = "English",
isbn = "1424409888",
pages = "2738--2743",
booktitle = "Proceedings of the American Control Conference",

}

TY - GEN

T1 - Pulling the strings on agreement

T2 - Anchoring, controllability, and graph automorphisms

AU - Rahmani, Amirreza

AU - Mesbahi, Mehran

PY - 2007/12/1

Y1 - 2007/12/1

N2 - This work examines the controlled Laplacian (or agreement) over a network of interconnected dynamic units. This dynamics has recently been the focus of a large number of research work in the systems community. Most of the existing work in this area- however- consider the unforced agreement protocol. In the present paper, we consider the controlled version of this dynamics and introduce graph theoretic conditions for its system theoretic properties. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, relates to the network controllability. Some of the ramifications of such a characterization are then explored.

AB - This work examines the controlled Laplacian (or agreement) over a network of interconnected dynamic units. This dynamics has recently been the focus of a large number of research work in the systems community. Most of the existing work in this area- however- consider the unforced agreement protocol. In the present paper, we consider the controlled version of this dynamics and introduce graph theoretic conditions for its system theoretic properties. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, relates to the network controllability. Some of the ramifications of such a characterization are then explored.

KW - Agreement dynamics

KW - Algebraic graph theory

KW - Automorphism group

KW - Controllability

UR - http://www.scopus.com/inward/record.url?scp=46449110844&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46449110844&partnerID=8YFLogxK

U2 - 10.1109/ACC.2007.4282502

DO - 10.1109/ACC.2007.4282502

M3 - Conference contribution

SN - 1424409888

SN - 9781424409884

SP - 2738

EP - 2743

BT - Proceedings of the American Control Conference

ER -