Saved in:
Bibliographic Details
Main Authors: Hadjicostis, Christoforos N., Dominguez-Garcia, Alejandro D.
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.06007
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911792510271488
author Hadjicostis, Christoforos N.
Dominguez-Garcia, Alejandro D.
author_facet Hadjicostis, Christoforos N.
Dominguez-Garcia, Alejandro D.
contents We consider the problem of average consensus in a distributed system comprising a set of nodes that can exchange information among themselves. We focus on a class of algorithms for solving such a problem whereby each node maintains a state and updates it iteratively as a linear combination of the states maintained by its in-neighbors, i.e., nodes from which it receives information directly. Averaging algorithms within this class can be thought of as discrete-time linear time-varying systems without external driving inputs and whose state matrix is column stochastic. As a result, the algorithms exhibit a global invariance property in that the sum of the state variables remains constant at all times. In this paper, we report on another invariance property for the aforementioned class of averaging algorithms. This property is local to each node and reflects the conservation of certain quantities capturing an aggregate of all the values received by a node from its in-neighbors and all the values sent by said node to its out-neighbors (i.e., nodes to which it sends information directly) throughout the execution of the averaging algorithm. We show how this newly-discovered invariant can be leveraged for detecting errors while executing the averaging algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_2403_06007
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Invariant Properties of Linear-Iterative Distributed Averaging Algorithms and Application to Error Detection
Hadjicostis, Christoforos N.
Dominguez-Garcia, Alejandro D.
Multiagent Systems
We consider the problem of average consensus in a distributed system comprising a set of nodes that can exchange information among themselves. We focus on a class of algorithms for solving such a problem whereby each node maintains a state and updates it iteratively as a linear combination of the states maintained by its in-neighbors, i.e., nodes from which it receives information directly. Averaging algorithms within this class can be thought of as discrete-time linear time-varying systems without external driving inputs and whose state matrix is column stochastic. As a result, the algorithms exhibit a global invariance property in that the sum of the state variables remains constant at all times. In this paper, we report on another invariance property for the aforementioned class of averaging algorithms. This property is local to each node and reflects the conservation of certain quantities capturing an aggregate of all the values received by a node from its in-neighbors and all the values sent by said node to its out-neighbors (i.e., nodes to which it sends information directly) throughout the execution of the averaging algorithm. We show how this newly-discovered invariant can be leveraged for detecting errors while executing the averaging algorithm.
title Invariant Properties of Linear-Iterative Distributed Averaging Algorithms and Application to Error Detection
topic Multiagent Systems
url https://arxiv.org/abs/2403.06007