Skip navigation
Skip navigation
The system will be down for maintenance between 8:00 and 8:15am on Thursday 13, December 2018

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

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

Description

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
URI: http://hdl.handle.net/1885/102532
Source: IEEE Transactions on Information Theory
DOI: 10.1109/TIT.2015.2468584

Download

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:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator