Decentralized estimation of the algebraic connectivity for strongly connected networks

Hasan A. Poonawala, Mark W. Spong

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

17 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 languageEnglish
Title of host publicationACC 2015 - 2015 American Control Conference
Pages4068-4073
Number of pages6
ISBN (Electronic)9781479986842
DOIs
StatePublished - Jul 28 2015
Event2015 American Control Conference, ACC 2015 - Chicago, United States
Duration: Jul 1 2015Jul 3 2015

Publication series

NameProceedings of the American Control Conference
Volume2015-July
ISSN (Print)0743-1619

Conference

Conference2015 American Control Conference, ACC 2015
Country/TerritoryUnited States
CityChicago
Period7/1/157/3/15

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Decentralized estimation of the algebraic connectivity for strongly connected networks'. Together they form a unique fingerprint.

Cite this