Agreement via the edge laplacian

Daniel Zelazo; Amirreza Rahmani; Mehran Mesbahi

doi:10.1109/CDC.2007.4434553

Agreement via the edge laplacian

Daniel Zelazo, Amirreza Rahmani, Mehran Mesbahi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

48 Scopus citations

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 language	English (US)
Title of host publication	Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
Pages	2309-2314
Number of pages	6
DOIs	https://doi.org/10.1109/CDC.2007.4434553
State	Published - 2007
Externally published	Yes
Event	46th IEEE Conference on Decision and Control 2007, CDC - New Orleans, LA, United States Duration: Dec 12 2007 → Dec 14 2007

Publication series

Name	Proceedings of the IEEE Conference on Decision and Control
ISSN (Print)	0191-2216

Other

Other	46th IEEE Conference on Decision and Control 2007, CDC
Country/Territory	United States
City	New Orleans, LA
Period	12/12/07 → 12/14/07

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Access to Document

10.1109/CDC.2007.4434553

Cite this

Zelazo, D, Rahmani, A & Mesbahi, M 2007, Agreement via the edge laplacian. in Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC., 4434553, Proceedings of the IEEE Conference on Decision and Control, 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

@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",

doi = "10.1109/CDC.2007.4434553",

language = "English (US)",

isbn = "1424414989",

series = "Proceedings of the IEEE Conference on Decision and Control",

pages = "2309--2314",

booktitle = "Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC",

note = "46th IEEE Conference on Decision and Control 2007, CDC ; Conference date: 12-12-2007 Through 14-12-2007",

}

TY - GEN

T1 - Agreement via the edge laplacian

AU - Zelazo, Daniel

AU - Rahmani, Amirreza

AU - Mesbahi, Mehran

PY - 2007

Y1 - 2007

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

AN - SCOPUS:62749188883

SN - 1424414989

SN - 9781424414987

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 2309

EP - 2314

BT - Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC

T2 - 46th IEEE Conference on Decision and Control 2007, CDC

Y2 - 12 December 2007 through 14 December 2007

ER -

Agreement via the edge laplacian

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this