Distributed estimation of algebraic connectivity of directed networks

    Authors

    C. Y. Li;Z. H. Qu

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    J. Gastrointest. Surg.

    Keywords

    Algebraic connectivity; Power iteration; Distributed estimation; Directed graph; COOPERATIVE CONTROL; GRAPHS; Automation & Control Systems; Operations Research & Management Science

    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. (C) 2013 Elsevier B.V. All rights reserved.

    Journal Title

    Systems & Control Letters

    Volume

    Syst. Control Lett.

    Issue/Number

    6

    Publication Date

    1-1-2013

    Document Type

    Article

    Language

    English

    First Page

    517

    Last Page

    524

    WOS Identifier

    62

    ISSN

    0167-6911

    Share

    COinS