Agreement via the edge laplacian

Daniel Zelazo, Amirreza Rahmani, Mehran Mesbahi

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

37 Citations (Scopus)

Abstract

This work explores the properties of the edge variant of the graph Laplacian in the context of the edge agreement problem. We show that the edge Laplacian, and its corresponding agreement protocol, provide a useful perspective on the well-known node agreement, or the consensus problem. Specifically, the dynamics induced by the edge Laplacian facilitates a better understanding of the role played by certain subgraphs, e.g., cycles and spanning trees, in the original agreement problem. We also point out a reduced order modeling of the edge agreement as parameterized by the spanning trees of the underlying graph.

Original languageEnglish
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Pages2309-2314
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event46th IEEE Conference on Decision and Control 2007, CDC - New Orleans, LA, United States
Duration: Dec 12 2007Dec 14 2007

Other

Other46th IEEE Conference on Decision and Control 2007, CDC
CountryUnited States
CityNew Orleans, LA
Period12/12/0712/14/07

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Zelazo, D., Rahmani, A., & Mesbahi, M. (2007). Agreement via the edge laplacian. In Proceedings of the IEEE Conference on Decision and Control (pp. 2309-2314). [4434553] https://doi.org/10.1109/CDC.2007.4434553

Agreement via the edge laplacian. / Zelazo, Daniel; Rahmani, Amirreza; Mesbahi, Mehran.

Proceedings of the IEEE Conference on Decision and Control. 2007. p. 2309-2314 4434553.

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

Zelazo, D, Rahmani, A & Mesbahi, M 2007, Agreement via the edge laplacian. in Proceedings of the IEEE Conference on Decision and Control., 4434553, pp. 2309-2314, 46th IEEE Conference on Decision and Control 2007, CDC, New Orleans, LA, United States, 12/12/07. https://doi.org/10.1109/CDC.2007.4434553
Zelazo D, Rahmani A, Mesbahi M. Agreement via the edge laplacian. In Proceedings of the IEEE Conference on Decision and Control. 2007. p. 2309-2314. 4434553 https://doi.org/10.1109/CDC.2007.4434553
Zelazo, Daniel ; Rahmani, Amirreza ; Mesbahi, Mehran. / Agreement via the edge laplacian. Proceedings of the IEEE Conference on Decision and Control. 2007. pp. 2309-2314
@inproceedings{0401de90c77643ddbc5829d81c87eec7,
title = "Agreement via the edge laplacian",
abstract = "This work explores the properties of the edge variant of the graph Laplacian in the context of the edge agreement problem. We show that the edge Laplacian, and its corresponding agreement protocol, provide a useful perspective on the well-known node agreement, or the consensus problem. Specifically, the dynamics induced by the edge Laplacian facilitates a better understanding of the role played by certain subgraphs, e.g., cycles and spanning trees, in the original agreement problem. We also point out a reduced order modeling of the edge agreement as parameterized by the spanning trees of the underlying graph.",
author = "Daniel Zelazo and Amirreza Rahmani and Mehran Mesbahi",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/CDC.2007.4434553",
language = "English",
isbn = "1424414989",
pages = "2309--2314",
booktitle = "Proceedings of the IEEE Conference on Decision and Control",

}

TY - GEN

T1 - Agreement via the edge laplacian

AU - Zelazo, Daniel

AU - Rahmani, Amirreza

AU - Mesbahi, Mehran

PY - 2007/12/1

Y1 - 2007/12/1

N2 - This work explores the properties of the edge variant of the graph Laplacian in the context of the edge agreement problem. We show that the edge Laplacian, and its corresponding agreement protocol, provide a useful perspective on the well-known node agreement, or the consensus problem. Specifically, the dynamics induced by the edge Laplacian facilitates a better understanding of the role played by certain subgraphs, e.g., cycles and spanning trees, in the original agreement problem. We also point out a reduced order modeling of the edge agreement as parameterized by the spanning trees of the underlying graph.

AB - This work explores the properties of the edge variant of the graph Laplacian in the context of the edge agreement problem. We show that the edge Laplacian, and its corresponding agreement protocol, provide a useful perspective on the well-known node agreement, or the consensus problem. Specifically, the dynamics induced by the edge Laplacian facilitates a better understanding of the role played by certain subgraphs, e.g., cycles and spanning trees, in the original agreement problem. We also point out a reduced order modeling of the edge agreement as parameterized by the spanning trees of the underlying graph.

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

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

U2 - 10.1109/CDC.2007.4434553

DO - 10.1109/CDC.2007.4434553

M3 - Conference contribution

SN - 1424414989

SN - 9781424414987

SP - 2309

EP - 2314

BT - Proceedings of the IEEE Conference on Decision and Control

ER -