Decentralized estimation of the algebraic connectivity for strongly connected networks

Hasan A. Poonawala; Mark W. Spong

doi:10.1109/ACC.2015.7171965

Decentralized estimation of the algebraic connectivity for strongly connected networks

Hasan A. Poonawala, Mark W. Spong

Mechanical and Aerospace Engineering

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

19 Scopus citations

Abstract

The second smallest eigenvalue equation of the Laplacian L of a network G is a parameter that captures important properties of the network. Applications such as synchronization of networked systems, consensus-based algorithms and network connectivity control may require one to regulate the magnitude of equation in order to achieve suitable network performance. The problem of decentralized estimation of equation for directed graphs is thus a relevant problem, yet it has received little attention thus far. We present an algorithm for its estimation and demonstrate its performance.

Original language	English
Title of host publication	ACC 2015 - 2015 American Control Conference
Pages	4068-4073
Number of pages	6
ISBN (Electronic)	9781479986842
DOIs	https://doi.org/10.1109/ACC.2015.7171965
State	Published - Jul 28 2015
Event	2015 American Control Conference, ACC 2015 - Chicago, United States Duration: Jul 1 2015 → Jul 3 2015

Publication series

Name	Proceedings of the American Control Conference
Volume	2015-July
ISSN (Print)	0743-1619

Conference

Conference	2015 American Control Conference, ACC 2015
Country/Territory	United States
City	Chicago
Period	7/1/15 → 7/3/15

Bibliographical note

Publisher Copyright:
© 2015 American Automatic Control Council.

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/ACC.2015.7171965

Cite this

@inproceedings{c35bb32de3a14a76804b44f85f73de22,

title = "Decentralized estimation of the algebraic connectivity for strongly connected networks",

abstract = "The second smallest eigenvalue equation of the Laplacian L of a network G is a parameter that captures important properties of the network. Applications such as synchronization of networked systems, consensus-based algorithms and network connectivity control may require one to regulate the magnitude of equation in order to achieve suitable network performance. The problem of decentralized estimation of equation for directed graphs is thus a relevant problem, yet it has received little attention thus far. We present an algorithm for its estimation and demonstrate its performance.",

author = "Poonawala, {Hasan A.} and Spong, {Mark W.}",

note = "Publisher Copyright: {\textcopyright} 2015 American Automatic Control Council.; 2015 American Control Conference, ACC 2015 ; Conference date: 01-07-2015 Through 03-07-2015",

year = "2015",

month = jul,

day = "28",

doi = "10.1109/ACC.2015.7171965",

language = "English",

series = "Proceedings of the American Control Conference",

pages = "4068--4073",

booktitle = "ACC 2015 - 2015 American Control Conference",

}

Poonawala, HA & Spong, MW 2015, Decentralized estimation of the algebraic connectivity for strongly connected networks. in ACC 2015 - 2015 American Control Conference., 7171965, Proceedings of the American Control Conference, vol. 2015-July, pp. 4068-4073, 2015 American Control Conference, ACC 2015, Chicago, United States, 7/1/15. https://doi.org/10.1109/ACC.2015.7171965

TY - GEN

T1 - Decentralized estimation of the algebraic connectivity for strongly connected networks

AU - Poonawala, Hasan A.

AU - Spong, Mark W.

PY - 2015/7/28

Y1 - 2015/7/28

N2 - The second smallest eigenvalue equation of the Laplacian L of a network G is a parameter that captures important properties of the network. Applications such as synchronization of networked systems, consensus-based algorithms and network connectivity control may require one to regulate the magnitude of equation in order to achieve suitable network performance. The problem of decentralized estimation of equation for directed graphs is thus a relevant problem, yet it has received little attention thus far. We present an algorithm for its estimation and demonstrate its performance.

AB - The second smallest eigenvalue equation of the Laplacian L of a network G is a parameter that captures important properties of the network. Applications such as synchronization of networked systems, consensus-based algorithms and network connectivity control may require one to regulate the magnitude of equation in order to achieve suitable network performance. The problem of decentralized estimation of equation for directed graphs is thus a relevant problem, yet it has received little attention thus far. We present an algorithm for its estimation and demonstrate its performance.

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

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

U2 - 10.1109/ACC.2015.7171965

DO - 10.1109/ACC.2015.7171965

M3 - Conference contribution

AN - SCOPUS:84940922040

T3 - Proceedings of the American Control Conference

SP - 4068

EP - 4073

BT - ACC 2015 - 2015 American Control Conference

T2 - 2015 American Control Conference, ACC 2015

Y2 - 1 July 2015 through 3 July 2015

ER -

Decentralized estimation of the algebraic connectivity for strongly connected networks

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this