Consensus-based Distributed Estimation of Laplacian Eigenvalues of Undirected Graphs

Thi-Minh Dung Tran 1 Alain Y. Kibangou 1
1 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : In this paper, we present a novel algorithm for estimating eigenvalues of the Laplacian matrix associated with the graph describing the network topology of a multi-agent system or a wireless sensor network. As recently shown, the average consensus matrix can be written as a product of Laplacian based consensus matrices whose stepsizes are given by the inverse of the nonzero Laplacian eigenvalues. Therefore, by solving the factorization of the average consensus matrix, we can infer the Laplacian eigenvalues. We show how solving such a matrix factorization problem in a distributed way. In particular, we formulate the problem as a constrained consensus problem. The proposed algorithm does not require great resources in both computation and storage. This algorithm can also be viewed as a way for decentralizing the design of finite-time average consensus protocol recently proposed in the literature. Eventually, the performance of the proposed algorithm is evaluated by means of simulation results.
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00842568
Contributor : Alain Kibangou <>
Submitted on : Monday, July 8, 2013 - 5:23:09 PM
Last modification on : Tuesday, April 24, 2018 - 1:48:01 PM
Document(s) archivé(s) le : Wednesday, October 9, 2013 - 4:24:10 AM

File

Paper2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00842568, version 1

Citation

Thi-Minh Dung Tran, Alain Y. Kibangou. Consensus-based Distributed Estimation of Laplacian Eigenvalues of Undirected Graphs. 12th biannual European Control Conference (ECC 2013), Jul 2013, Zurich, Switzerland. pp.227-232. ⟨hal-00842568⟩

Share

Metrics

Record views

720

Files downloads

467