Bounds On The Smallest Eigenvalue Of A Pinned Laplacian Matrix

Keywords

consensus; eigenvalue bounds; Laplacian spectra; leader selection; multi-agent systems; network pinning; spectral graph theory; synchronization

Abstract

In this note, we study a networked system with single/multiple pinning. Given a weighted and undirected network, we derive lower and upper bounds on its algebraic connectivity with respect to the reference signal. The bounds are derived by partitioning the network in terms of distance of each node from the pinning set. Upper and lower bounds for two networks with differing topologies are computed to demonstrate the tightness of the derived results. It is shown, using the derived bounds, how requirements on the number of pinning nodes and pinning gain required for achieving stability or a specified convergence rate for the network can be easily obtained.

Publication Date

8-1-2018

Publication Title

IEEE Transactions on Automatic Control

Volume

63

Issue

8

Number of Pages

2641-2646

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/TAC.2017.2771944

Socpus ID

85035140202 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS