Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Deterministic Gossiping with a Periodic Protocol

Date

Authors

Mou, Shaoshuai

Yu, Changbin (Brad)

Anderson, Brian

Morse, A Stephen

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

A sequence of allowable gossips between pairs of agents in a group is complete if the gossip graph which the sequence generates is a connected spanning subgraph of the graph of all allowable gossip pairs; such a sequence is minimally complete if there is

Keywords

Keywords: Eigen-value; Rate of convergence; Second largest eigenvalue; Stochastic matrices; Subgraphs; Time step; Approximation theory; Trees (mathematics); Eigenvalues and eigenfunctions

URI

http://hdl.handle.net/1885/59640

Collections

ANU Research Publications

Source

IEEE Conference on Decision and Control 2010 Proceedings

Type

Conference paper

DOI

10.1109/CDC.2010.5718066

Restricted until

2037-12-31

Downloads

File

Description

01_Mou_Deterministic_Gossiping_with_a_2010.pdf (109.58 KB)