Skip navigation
Skip navigation

Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence

Shi, Guodong; Anderson, Brian; Johansson , Karl Henrik


Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step, every node updates its state based on a Bernoulli trial, independent in time and among different nodes: either averaging among the neighbor set generated by the random graph, or sticking with its current state. The connectivity-independence and...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Journal article
Source: IEEE Transactions on Information Theory
DOI: 10.1109/TIT.2015.2468584


File Description SizeFormat Image
01_Shi_Consensus_over_Random_Graph_2015.pdf403.61 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator