Summary
International Symposium on Nonlinear Theory and its Applications
2017
Session Number:B1L-D-2
Session:
Number:B1L-D-2-1
Analysis of a Pseudo-Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks
Tomohisa Urakami, Norikazu Takahashi,
pp.427-430
Publication Date:2017/12/4
Online ISSN:2188-5079
DOI:10.34385/proc.29.B1L-D-2-1
Summary:
The algebraic connectivity is an important measure of a network because it represents how well the network is connected. Recently, Yang et al. proposed a pseudo- decentralized continuous-time algorithm for all agents in a multiagent network to estimate the algebraic connectivity. In this paper, we consider a discrete-time version of this algorithm, and examine the validity through theoretical analysis and numerical experiments.