Title

Distributed Estimation Of Algebraic Connectivity Of Directed Networks

Keywords

Algebraic connectivity; Directed graph; Distributed estimation; Power iteration

Abstract

In directed network, algebraic connectivity is defined as the second smallest eigenvalue of graph Laplacian, and it captures the most conservative estimate of convergence rate and synchronicity of networked systems. In this paper, distributed estimation of algebraic connectivity of directed and connected graphs is studied using a decentralized power iteration scheme. Specifically, the proposed scheme is introduced in discrete time domain in order to take advantage of the discretized nature of information flow among networked systems and it shows that, with the knowledge of the first left eigenvector associated with trivial eigenvalue of graph Laplacian, distributed estimation of algebraic connectivity becomes possible. Moreover, it is revealed that the proposed estimation scheme still performs in estimating the complex eigenvalues. Simulation results demonstrate the effectiveness of the proposed scheme. © 2013 Elsevier B.V. All rights reserved.

Publication Date

4-29-2013

Publication Title

Systems and Control Letters

Volume

62

Issue

6

Number of Pages

517-524

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.sysconle.2013.03.002

Socpus ID

84876516839 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84876516839

This document is currently not available here.

Share

COinS